杨辉三角形

public static int[][] getYangehi(int n){
int[][] yang = new int[n][2n-1];
yang[0][n-1] = 1;
for(int i=1;i<n;i++){
for(int j=0;j<2n-1;j++){
if(j== n-1-i || j == n+i-1 ){
yang[i][j] = 1;
}else {
if(j-1>=0 && j+1 <2*n-1){
yang[i][j] = yang[i-1][j-1]+yang[i-1][j+1];
}
}
}
}
return yang;
}