#include <iostream>
using namespace std;
void Recursion(int n) {
if (n <= 0) {
return;
}
Recursion(n - 1);
for (int i = 0; i < n; i++) {
cout << n << " ";
}
cout << endl;
}
int main() {
cout << "递归方式解决" << endl;
Recursion(5);
cout << endl;
cout << "非递归方式解决" << endl;
for (int i = 1; i <= 6; i++) {
for (int j = 1; j <= i; j++) {
cout << i << " ";
}
cout << endl;
}
return 0;
}