杨辉三角java代码

public class YangHuiTriangle { public static void main(String[] args) { int n = 10; // 控制杨辉三角的行数 int[][] arr = new int[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j <= i; j++) { if (j == 0 || j == i) { arr[i][j] = 1; } else { arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j]; } System.out.print(arr[i][j] + " "); } System.out.println(); } }