杨辉三角

public class Test01 { 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 ;1++)

{

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= 8 ;j <= i ;j++)

system.out.print(a[i][j] +"\t");

System.out.printIn()

} } }

转载于:https://my.oschina.net/u/3824141/blog/1812213