杨辉三角java

class YangHui{
public static void main(String[] args){

int[][] yangHui=new int[10][];  //10行

for(int i=0;i<yangHui.length;i++){
yangHui[i]=new int[i+1];   //每行有多少个元素
}

for(int i=0;i<yangHui.length;i++){
for(int j=0;j<yangHui[i].length;j++){
yangHui[i][0]=yangHui[i][i]=1;
if(i>1&&j>0&&j<i){
yangHui[i][j]=yangHui[i-1][j-1]+yangHui[i-1][j];
}
}
}

for(int i=0;i<yangHui.length;i++){                      //遍历
for(int j=0;j<yangHui[i].length;j++){
System.out.print(yangHui[i][j]+"\t");
}
System.out.println();
}
}
}