杨辉三角

public class YangHui{
     public static void main(String [] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();                            //扫描器(需先导入Scanner包
        int [][] a = new int[n][n];                        //创建int型二维数组
        for(int i=0;i<n;i++){                            //遍历
            for(int j=0;j<=i;j++){
                if(j==0|j==i){                            //边
                    a[i][j]=1;                    
                }
                else{
                    a[i][j]=a[i-1][j]+a[i-1][j-1];        //边以内
                }
            }
        }
        Object[][] obj  = new Object[n][2*n];            //创建数组
        for(int i = 0;i<n;i++){                            //遍历
            for(int j = 0;j<2*n;j++){                    
                if(j==n-i|j==n+i){                        //边
                    obj[i][j] = 1;
                    System.out.print(obj[i][j]+"  ");
                }
                else if(j>n-i&j<n+i&(j-n+i)%2==0){        //边以内每隔一个输出一个非空格
                    
                        obj[i][j]=a[i][(j-n+i)/2];        //把a数组套入obj内
                        System.out.print(obj[i][j]+"  ");
                    
                }
                else{
                    obj[i][j] ="  ";                    //空白部分
                    System.out.print(obj[i][j]+"  ");
                }
            }
            System.out.println();
        }
            }
}