/**
* 打印出杨辉三角形
*/
public void yanghui(int line) {
int[] a = new int[line];
for (int i = 0; i < line; i++) {
a[i] = 1;
}
if (line == 1) {
System.out.println(1);
} else if (line == 2) {
System.out.println(1);
System.out.println(1 + "\t" + 1);
} else {
System.out.println(1);
System.out.println(1 + "\t" + 1);
for (int i = 1; i < line - 1; i++) {
for (int j = i; j >= 1; j--) {
a[j] = a[j] + a[j - 1];
}
for (int k = 0; k < i + 2; k++) {
System.out.print(a[k] + "\t");
}
System.out.println();
}
}
}
杨辉三角形(do)
最新推荐文章于 2019-04-06 17:44:32 发布