使用二维数组输出杨辉三角

import java.until.Scanner;
public class dome1｛
    public static void main(String[] args){
    Scanner a=new Scanner(System.in);
    System. out. print("请求入组数");
    int group=a. nextInt();
    int[][] s=new int[group][];
    for(int i=0;i<s.length;i++){
         s[i]=new s[i+1];
         for(int j=0;j<s.length;j++){
           if(j==0||i==j){
           s[i][j]=1;
      }else{
         s[i][j]=s[i-1][j]+s[i-1][j-1];
      }
      System. out. print(s[i][j]+"\t");
     }
     System. out. println();
    }
    }
｝