//杨辉三角
public static void yhsj(){
int[][] sj = new int[10][10];
for(int i = 0;i<10;i++){
for(int k = 10 -1;k > i;k--){
System.out.print(" ");
}
for(int j = 0;j<i+1;j++){
if(j == 0 || i == 0){
sj[i][j]=1;
}else{
sj[i][j]= sj[i-1][j-1]+sj[i-1][j];
}
System.out.print(sj[i][j]+" ");
}
System.out.println();
}
}
public static void yhsj(){
int[][] sj = new int[10][10];
for(int i = 0;i<10;i++){
for(int k = 10 -1;k > i;k--){
System.out.print(" ");
}
for(int j = 0;j<i+1;j++){
if(j == 0 || i == 0){
sj[i][j]=1;
}else{
sj[i][j]= sj[i-1][j-1]+sj[i-1][j];
}
System.out.print(sj[i][j]+" ");
}
System.out.println();
}
}