//杨辉三角
import java.util.Scanner;
public class Exercise03
{
public static void main(String[] args)
{
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][i] = 1;
for(int j = 0 ; j<=i;j++)
System.out.print(a[i][j]+”\t”);
System.out.println(); //换行
}
}
}
结果如下: