Java—杨辉三角形
如图所示
public static void test6(){
Scanner input=new Scanner(System.in);
System.out.print("请输入杨辉三角形的层数:");
int num= input.nextInt();
int[][] arrays=new int[num][];
for (int i = 0; i < arrays.length; i++) {
arrays[i] = new int[i+1];
for (int j = 0; j <arrays[i].length; j++) {
if (j == 0 || j == arrays[i].length-1) {
arrays[i][j] = 1;
} else {
arrays[i][j] = arrays[i - 1][j] + arrays[i-1][j-1];
}
}
}
for (int i = 0; i < arrays.length; i++) {
for (int j = 0; j < arrays.length-i-1; j++) {
System.out.print(" ");
}
for (int j = 0; j < arrays[i].length; j++) {
System.out.print(arrays[i][j]+" ");
}
System.out.println();
}
}
运行结果
请输入杨辉三角形的层数:7
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1