Java杨辉三角

public class PasTraiHome {
    public static void main(String[] args) {
        int arr [][] = new int[10][];
        for (int i = 0; i < arr.length; i++) {
            arr[i]=new int[i+1];//每一层的范围和i有关系
            arr[i][0] = 1;//每一次的第0坐标都是1
            for (int j = 1; j < i; j++) {//中间的值
                arr[i][j]=arr[i-1][j-1]+arr[i-1][j];
            }//中间的计算
            arr[i][i] = 1;//右边的1
        }
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j <arr.length-i ; j++) {
                System.out.print(" ");
            }
            for (int j = 0; j < arr[i].length; j++) {
                System.out.print(arr[i][j]+" ");
            }
            System.out.println();
        }

    }
}