杨辉三角-Java

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[][] array = new int[n+1][n+1];
        for(int i = 0; i < n; i++){
            array[i][0] = 1;
            array[i][i] = 1;
        }
        for(int i = 2; i < n; i++){
            for(int j = 1; j < i; j++){
                array[i][j] = array[i-1][j-1] + array[i-1][j];
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j <= i; j++){
                if(array[i][j] != 0){
                    System.out.print(array[i][j]+" ");
                }
            }
            System.out.println();
        }

    }
}