public class TestHomeWork7_21{
public static void main(String[] args) {
YangHui(5);
}
public static void YangHui(int n) {
int[][] arr = new int[n][];
//把边界值赋1
for (int i = 0; i < arr.length; i++) {
arr[i] = new int[i+1];
arr[i][0] = 1;
arr[i][i] = 1;
}
//计算中间部分的值
for (int i= 2; i < arr.length; i++) {
//从1开始和最后减1,都是去除边界的1
for (int j = 1; j < arr[i].length-1; j++) {
arr[i][j] = arr[i-1][j] + arr[i-1][j-1];
}
}
//输出
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
System.out.print(arr[i][j] );
}
System.out.println();
}
}
}
java:分步实现杨辉三角
最新推荐文章于 2022-10-22 15:06:02 发布