/**
* 1 观察下面杨辉三角(前5行)并打印出前7行
* 0 1 2 3 4
*0: 1
*1: 1 1
*2: 1 2 1
*3: 1 3 3 1
*4: 1 4 6 4 1
*/
public class Triangle {
public static void main(String[] args) {
int[][] arr = new int[7][];
YangHuiTriangle(arr);
}
public static void YangHuiTriangle(int[][] arr) {
for (int i = 0; i < arr.length; i++) {
// 将一维数组中的进行扩容
arr[i] = new int[i + 1];
for (int j = 0; j < arr[i].length; j++) {
if (j == 0 || i == j) {
arr[i][j] = 1;
}else {
arr[i][j]=arr[i-1][j-1]+arr[i-1][j];
}
}
}
//循环遍历
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] + "\t");
}
System.out.println();
}
}
}
杨辉三角
最新推荐文章于 2024-07-12 16:03:26 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)