杨辉三角

public  void gererate(int nums){    int a[][]=new int[nums][nums];    int k;    for(int i=0;i<nums;i++){      k=i;        while (nums-k>=0){            System.out.print(" ");            k++;        }        for(int j=0;j<=i;j++){            if(j==0||j==i){                a[i][j]=1;                System.out.print(a[i][j]+" ");            }else{                a[i][j]=a[i-1][j-1]+a[i-1][j];                System.out.print(a[i][j]+" ");            }        }        System.out.println();    }}public static void main(String[] args) {    pinghengNumber pn = new pinghengNumber();    int nums[] = {0, 2, 0, 3, 4, 0, 0, 1};    pn.gererate(10);}           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