用二维数打印杨辉三角

Exercise

System. out.println("输入行");

Scanner scan＝new Scanner( System. in);

int n=scan.nextInt();

int [][]a＝new int[n][n];

a[0][0]=1;

System. out.println(1);

for(int i=1;i<n;i++)

{

a[i][0]=1;

for(int j=1;j<i;j++)

{

a[i][j]=a[i－1][j－1]+a[i-1][j];

}

a[i][j]=1

for(int j=0;j<=i;j++)

System. out.println(a[i][j]+"\t");

System. out.println();

}