#include <iostream>
using namespace std;
void printf1(int i,int num){
if (i <= num){
for(int j = 1; j <= i; ++j){
cout << i << " ";
}
cout << endl;
printf1(i+1,num);
}
}
void printf2(int num){
for (int i = 1; i <= num; ++i){
for(int j = 1; j <= i; ++j){
cout << i << " ";
}
cout << endl;
}
}
int main() {
cout << "递归算法实现:" << endl;
printf1(1,4);
cout << "非递归算法实现:" << endl;
printf2(4);
return 0;
}