package 基础算法;
public class triangle {
public static void main(String[] args) {
int[][] twoDimension = new int[10][21];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 21; j++) {
if (j == (21 - 2 * i) / 2 | j == (21 + 2 * i) / 2) {
twoDimension[i][j] = 1;
//System.out.print("1");
} else {
twoDimension[i][j]=0;
//System.out.print(" ");
}
}
//ystem.out.println();
}
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 19; j++) {
if(twoDimension[i-1][j-1]!=0&&twoDimension[i-1][j+1]!=0){
twoDimension[i][j]=twoDimension[i-1][j-1]+twoDimension[i-1][j+1];
}
}
}
for(int i=0;i<10;i++){
for(int j=0;j<21;j++){
if(twoDimension[i][j]!=0){
System.out.print(twoDimension[i][j]);
}else{
System.out.print(" ");
}
}
System.out.println();
}
}
}
大家不要学我给包名起了个中文名;
杨辉三角的三个步骤:
1:给外围的1赋值
2:用递归给内层赋值
3:打印;
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1