杨辉三角（Java入门）

主要用到二维数组

public class yanghuisanjiao {
    public  static  void main(String [] args) {
        Scanner in = new Scanner(System.in) ;
        int number = in.nextInt() ;
        int [][] arr1 = new int[number][] ;
        for (int i = 0 ; i < arr1.length ; i++) {
            arr1[i] =new int[i+1] ;
            arr1[i][0] = 1 ;
            arr1[i][i] = 1 ;
            if(i > 1) {
                for(int j = 1 ; j < arr1[i].length - 1 ; j++) {
                    arr1[i][j] =arr1[i-1][j-1] + arr1[i-1][j] ;
                }
            }
        }
        for(int i = 0 ; i < arr1.length ; i ++) {
            for(int j = 0 ; j < arr1[i].length ; j++) {
                System.out.print(arr1[i][j]+" ");
            }
            System.out.println();
        }
    }
}