15、杨辉三角

public class Test2 {
    public static void main(String[] args) {
        int row = 5;
        int[][] data = new int[5][];
        //先打印基本的固定数据
        for (int i = 0; i < row; i++) {
            data[i] = new int[i + 1];
            data[i][0] = 1;
            data[i][i] = 1;
        }
    //打印需要 计算 得到的数据
        for (int i = 2; i < row; i++) 
            for (int j = 1; j < i; j++) {  //j<i 即可，不用==i，因为i已经 填充了固定数据
                data[i][j] = data[i-1][j - 1] + data[i - 1][j];
            }

        // print
        for (int i = 0; i < row; i++) {
            for (int k = 0; k < row-i-1; k++)
               System.out.print("  ");
            for (int j = 0; j <= i; j++) {
                System.out.print(data[i][j] + "  ");

            }
            System.out.println();
        }
    }
}