杨辉三角

public class Demo04{
    public static void main(String[] args){
        int[][] arr = new int[10][10];
        yanghui(arr);
        print(arr);

    }
    public static void yanghui(int[][] arr){
        for (int i=0; i<arr.length; i++) {
            for (int j=0; j<=i; j++) {
                if(i==j||j==0){
                    arr[i][j] = 1;
                    arr[i][0] = 1;
                }else{
                    arr[i][j] = arr[i-1][j-1] + arr[i-1][j];
                }
            }
        }
    }
    public static void print(int[][] arr){
        int count = 0;
        for (int i=0; i<arr.length; i++) {
            count++;
            for (int k=1; k<=10-count; k++) {
                    System.out.print(" ");
                }
            for (int j=0; j<=i; j++) {
                System.out.print(arr[i][j]+" ");
            }
            System.out.println();
        }
    }
}