实例020-实现输出杨辉三角

代码如下：

public class YangHuiTriangle {
    public static void main(String[] args) {
        int[][] array = new int[10][10];
        int i,j;
        for (i = 0; i < array.length; i++) {
            for (j = 0; j <= i; j++) {
                if (j == 0 || j == i) {
                    array[i][j] = 1;
                } else {
                    array[i][j]=array[i-1][j-1]+array[i-1][j];
                }
                System.out.print(array[i][j]+"\t");
            }
            System.out.println();
        }
    }
}

运行结果：

1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1

Process finished with exit code 0