杨辉三角垂直打印

public class Demo {
    public static void main(String[] args){
        int[][] arr = new int[10][];
        //每一行的元素比下标大1
        for (int i = 0; i < arr.length; i++) {
            arr[i]=new int[i+1];
        }
        //让每行的头尾都为1
        for (int i = 0; i < arr.length; i++) {
            arr[i][0]=1;
            arr[i][arr[i].length-1]=1;
        }
        //让第三行开始除开头尾元素进行逻辑计算
        for (int i = 2; i < arr.length; i++) {
            for (int j = 1 ; j < arr[i].length-1; j++) {
                arr[i][j] = arr[i-1][j]+arr[i-1][j-1];
            }
        }
        //遍历二位数组
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                System.out.print(arr[i][j]+"\t");
            }
            System.out.println();
        }
    }
}