编辑代码

public class NumberPattern {
    //递归
    public static void PatternRecursive(int n) {
        if (n <= 0) {
            return;
        }
        printRow(n);
        System.out.println();
        PatternRecursive(n - 1);
    }
    private static void printRow(int num) {
        for(int i = 1;i <= num; i++){
            System.out.print(num + " ");
        }
    }
    //非递归
    public static void PatternIterative(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("20052218 刘嘉源");
        System.out.println("递归算法：");
        PatternRecursive(n);
        System.out.println("非递归算法：");
        PatternIterative(n);
    }
}