import java.util.Scanner;
public class YangHuiTest {
public static void main(String[] args)
Scanner scanner = new Scanner(System.in);
System.out.print("请输入杨辉三角的列数:");//杨辉三角行数和列数一样
int num = scanner.nextInt();
// 声明并初始化二维数组
int[][] yangHui = new int[num][];
// 给数组的元素赋值
for (int i = 0; i < yangHui.length; i++) {
yangHui[i] = new int[i + 1];
// 给首末元素赋值
yangHui[i][0] = 1;
yangHui[i][i] = 1;
// 给每行非首末元素赋值
if (i > 1) {
for (int j = 1; j < yangHui[i].length - 1; j++) {
yangHui[i][j] = yangHui[i - 1][j - 1] + yangHui[i - 1][j];
}
}
}
// 遍历二维数组
for (int i = 0; i < yangHui.length; i++) {
for (int j = 0; j < yangHui[i].length; j++) {
System.out.print(yangHui[i][j] + " ");
}
System.out.println();
}
}
}
杨辉三角的列数和行数是一样的
可以看到从第三列开始:2=1+1,就是它上面那个数+它上前方的那个数,3=1+2;4=1+3;6=3+3…
那么用数组表示就是:
yangHui[i][j] = yangHui[i - 1][j - 1] + yangHui[i - 1][j];
上面代码的效果:
输入多少就打印多少列
请输入杨辉三角的列数:5
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1