java杨辉三角实现
public static void main(String[] args) {
int[][] arr=new int[20][];
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]+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();
}
}