/**
* 经典杨辉三角
* 1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
* @author 378375
*/
//1.初始化10行数组
int[][] yangHui = new int[10][];
//2.初始化列数
for (int i = 0; i < yangHui.length; i++) {
yangHui[i] = new int[i+1];
}
//3.给二维数组的第一列和最后一列赋值为:1
for (int i = 0; i < yangHui.length; i++) {
yangHui[i][0] = yangHui[i][i] = 1;
}
//4.根据规律赋值三角内部相应元素赋值
for (int i = 0; i < yangHui.length; i++) {
for (int j = 0; j < yangHui[i].length; j++) {
if(i > 1 && j > 0 && i > j){
yangHui[i][j] = yangHui[i-1][j] + yangHui[i-1][j-1];
}
}
}
//5.遍历
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();
}
* 经典杨辉三角
* 1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
* @author 378375
*/
//1.初始化10行数组
int[][] yangHui = new int[10][];
//2.初始化列数
for (int i = 0; i < yangHui.length; i++) {
yangHui[i] = new int[i+1];
}
//3.给二维数组的第一列和最后一列赋值为:1
for (int i = 0; i < yangHui.length; i++) {
yangHui[i][0] = yangHui[i][i] = 1;
}
//4.根据规律赋值三角内部相应元素赋值
for (int i = 0; i < yangHui.length; i++) {
for (int j = 0; j < yangHui[i].length; j++) {
if(i > 1 && j > 0 && i > j){
yangHui[i][j] = yangHui[i-1][j] + yangHui[i-1][j-1];
}
}
}
//5.遍历
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();
}