package heping.contact;
public class Array_yanghuisanjiao {
public static void main(String[] args){
//声明二维动态数组
int [][] arr = new int [10][];
//数组首末都是1,中间的数等于上一层两个数的和
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 == j || j == 0){
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<=i;j++){
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
08-12
2528
09-12
4227
11-19
2824