杨辉三角

public class PascalTriangle {
    public static void main(String[] args) {
        int[][] pascalTriangle = new int[10][];
        // 赋值
        for (int i = 0; i < pascalTriangle.length; i++) {
            pascalTriangle[i] = new int[i + 1];
            pascalTriangle[i][0] = pascalTriangle[i][i] = 1;
            for (int j = 1; j < pascalTriangle[i].length - 1; j++) {
                pascalTriangle[i][j] = pascalTriangle[i - 1][j - 1] +
                        pascalTriangle[i - 1][j];
            }
        }
        // 遍历数组
        for (int i = 0; i < pascalTriangle.length; i++) {
            for (int j = 1; j < pascalTriangle[i].length - 1; j++) {
                System.out.print(pascalTriangle[i][j]+ "   ");
            }
            System.out.println();
        }
    }
}

杨辉三角

原文：https://www.cnblogs.com/xjxlovehmx/p/14382512.html