zzulioj1130: 杨辉三角Java

import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[][] arr = new int[n][n];
        for (int i = 0; i < n; i++) {
            arr[i][0] = 1;
            arr[i][i] = 1;
        }

        if(n>2){
            for (int i = 2; i < n; i++) {
                for (int j = 1; j < i; j++) {
                    arr[i][j] = arr[i-1][j-1] + arr[i-1][j];
                }
            }
        }

        printLn(arr);
    }

    private static void printLn(int[][] arr) {
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j <= i; j++) {
                    System.out.print(arr[i][j]+" ");
            }
            System.out.println();
        }
    }
}