/*
- 杨辉三角
*1
*1 1
*1 2 1
*1 3 3 1
*/
public class YangHuiTest {
public static void main(String[] args) {
/*//1、声明并初始化二维数组
int[][] yangHui = new int[10][];
//2、给数组元素赋值
for(int i =0 ;i<yangHui.length;i++) {
yangHui[i] =new int[i+1];
//2.1给首末元素赋值
yangHui[i][0] =1;
yangHui[i][i] =1;
if(i>1) {
for(int j=1;j<yangHui[i].length-1;j++) {
yangHui[i][j] = yangHui[i-1][j-1]+yangHui[i-1][j];
}
}
}
//3、遍历二维数组
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();
}*/
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(j==0||j==i) {
arr[i][j] =1;
}else {
arr[i][j] = arr[i-1][j-1]+arr[i-1][j];
}
// System.out.print(arr[i][j]+" ");
}
// System.out.println();
}
for(int i=0;i<arr.length;i++) {
for(int j =0;j<arr.length-i;j++) {
System.out.print(" ");
}
for(int k =0;k<=i;k++) {
System.out.print(arr[i][k]+" ");
}
System.out.println();
}
}
}