public static void main(String[] args) {
int i, j;
int[][] a = new int[10][];
for (i = 0; i < a.length; i++) {
a[i] = new int[i + 1];
}
for (i = 0; i < a.length; i++) {
for (j = 0; j < a[i].length; j++) {
if (i == j || j == 0) {
a[i][j] = 1;
} else {
a[i][j] = a[i - 1][j] + a[i - 1][j - 1];
}
}
}
for (i = 0; i < a.length; i++) {
for (j = 0; j < a[i].length; j++) {
System.out.print("\t" + a[i][j]);
}
System.out.println();
}
}
}
Java打印杨辉三角形
于 2023-03-24 21:22:13 首次发布