杨辉三角形
package QFTest;
public class Test_17 {
public static void main(String[] args) {
int[][] arrs=new int[7][7];
yangHui(arrs);
for (int i = 0; i <arrs.length ; i++) {
for(int k=0;k<arrs.length-i;k++) {
System.out.print(" ");
}
for (int j = 0; j <arrs[i].length ; j++) {
System.out.print(arrs[i][j]+" ");
}
System.out.println();
}
}
public static void yangHui(int[][] arrs){
for(int i=0;i<arrs.length;i++){
arrs[i]=new int[i+1];
arrs[i][0]=1;
arrs[i][i]=1;
for(int j=1;j<arrs[i].length-1;j++){
if(i!=j){
arrs[i][j]=arrs[i-1][j]+arrs[i-1][j-1];
}
}
}
}
}
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