int arr[][] = new int[10][];
for (int i = 0; i < arr.length; i++){
arr[i] = new int[i + 1];
for (int j = 0; j < arr[i].length; j++){
if (i == 0 && j == 0){
arr[i][j] = 1;
continue;
}
if ((i - 1 >= 0) && (j >= 0) && (j < arr[i - 1].length))arr[i][j] += arr[i - 1][j];
if ((i - 1 >= 0) && (j - 1 >= 0) && (j - 1 < arr[i - 1].length))arr[i][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杨辉三角(帕斯卡三角)
最新推荐文章于 2024-09-25 10:59:43 发布