编辑代码

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

}