杨辉三角

public static void print() {

int[][] a = new int[5][5];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < i + 1; j++) {
if (i == 0 || j == 0 || i == j) {
a[i][j] = 1;
} else {
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
System.out.print(a[i][j]);
}
System.out.println();
}

}


输出为

1
11
121
1331
14641