用java计算12行杨辉三角

public class Work {

    public static void main(String[] args) {
        int i,j;
        int level=12;
        int[][] iaY=new int[level][];
        System.out.println("杨辉三角形");
        for(i=0;i<iaY.length;i++)
            iaY[i]=new int[i+1];
        iaY[0][0]=1;
        for(i=1;i<iaY.length;i++) {
            iaY[i][0] = 1;
            for (j = 1; j < iaY[i].length - 1; j++)
                iaY[i][j] = iaY[i - 1][j - 1] + iaY[i - 1][j];
            iaY[i][iaY[i].length - 1] = 1;
        }
        for(int[] row:iaY)
        {
            for(int col:row)
                System.out.print(col+" ");
            System.out.println();
        }
    //System.out.println("\n数组a的长度是:"+a.length);
    }
}