不规则数组实现杨辉三角

import java.util.Scanner;

/**
 * 不规则数组输出杨辉三角
 * 
 * @author 逸川同学
 * 1 
 * 1 1
 * 1 2 1
 * 1 3 3 1
 */
public class YangHui {
    private static Scanner scanner;

    public static void main(String[] args) {
        scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int n = scanner.nextInt();
            //定义一个不规则数组
            int[][] a = new int[n][];
            for (int i = 0; i < n; i++) {
                a[i] = new int[i+1];
            }
            //进行赋值
            for (int i = 0; i < a.length; i++) {
                for (int j = 0; j < a[i].length; j++) {
                    //第一个和最后一个都是1，其余的都是他的上一个和上一个的前一个的和
                    if(j==0||(j == a[i].length-1)){
                        a[i][j] = 1;
                    }else {
                        a[i][j] = a[i-1][j-1]+a[i-1][j]; 
                    }
                }
            }
            //打印
            for (int[] is : a) {
                for (int i : is) {
                    System.out.print(i+" ");
                }
                System.out.println();
            }
        }
    }
}