杨辉三角形

杨辉三角形

import java.util.Arrays;

public class San {
    public static void main(String[] args) {
        int [][]a=new int[10][];
        for (int i=0;i<a.length;i++){
            a[i]=new int[i+1];
        }
        for (int i=0;i<a.length;i++){
            for (int j=0;j<a[i].length;j++){
                if (j==0||j==a[i].length-1){
                    a[i][j]=1;
                }else if (i>=2){
                    a[i][j]=a[i-1][j-1]+a[i-1][j];
                }
            }
            System.out.println(Arrays.toString(a[i]));
        }

    }
}