某校2020专硕编程题-杨辉三角

题目

输入正整数n，输出n行杨辉三角
如：n=4
1
1 1
1 2 1
1 3 3 1

Java实现

public static void test05(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if (n < 1) return;
        int[][] a = new int[n][n];
        a[0][0] = 1;
        for (int i = 1; i < n; i++) {
            for (int j = 0; j < n ; j++) {
                a[i][0] = 1;
                if (0 < j && j < n-1) {
                    a[i][j] = a[i-1][j-1] + a[i-1][j];
                }
                if (j == i){
                    a[i][j] = 1;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (a[i][j] != 0){
                    System.out.print(a[i][j]+" ");
                }

            }
            System.out.println();
        }
}