Java 实现杨辉三角 - 代码示例与解释

public class YangHuiTriangle { public static void main(String[] args) { int n = 10; int[][] triangle = new int[n][n];

    // 初始化第一列和对角线为1
    for (int i = 0; i < n; i++) {
        triangle[i][0] = 1;
        triangle[i][i] = 1;
    }

    // 计算其它位置
    for (int i = 2; i < n; i++) {
        for (int j = 1; j < i; j++) {
            triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
        }
    }

    // 输出杨辉三角
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            System.out.print(triangle[i][j] + ' ');
        }
        System.out.println();
    }
}