编辑代码

public class NumberPattern {

    // 递归算法
    public static void printPatternRecursively(int n) {
        if (n == 1) {
            System.out.println(1);
        } else {
            printPatternRecursively(n - 1);
            for (int i = 0; i < n; i++) {
                System.out.print(n + " ");
            }
            System.out.println();
        }
    }

    // 非递归算法
    public static void printPatternNonRecursively(int n) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print(i + " ");
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        int n = 5;

        System.out.println("递归算法输出：");
        printPatternRecursively(n);

        System.out.println("\n非递归算法输出：");
        printPatternNonRecursively(n);
    }
}