package boluo;
public class Test {
public static void main(String[] args) {
//杨辉三角
int[][] num = new int[10][10];
for (int i = 0; i < num.length; i++) {
for (int j = 0; j < i + 1; j++) {
if (i == 0 || i == j || j == 0) {
num[i][j] = 1;
} else {
num[i][j] = num[i - 1][j] + num[i - 1][j - 1];
}
}
}
for (int i = 0; i < num.length; i++) {
for (int j = 0; j < i + 1; j++) {
System.out.print(num[i][j] + "\t");
}
System.out.println();
}
}
}
输出杨辉三角
于 2019-09-17 23:42:55 首次发布