杨辉三角

//杨辉三角
        int[][] totalArr = new int[10][];
        for(int i = 1;i <= totalArr.length;i++) {
            int[] arr =new int[i];
            for(int j = 0; j < arr.length; j++ ) {
                if(j == 0 || j == arr.length - 1) {
                    arr[j] = 1;
                }else {

                    arr[j] = totalArr[i -2] [j] + totalArr[i - 2][j -1];
                }

            }
            totalArr[i-1] = arr;
        }