杨辉三角
代码:
public class Test { public static void main(String[] args) { // TODO Auto-generated method stub int i = 0 ,j = 0 , N=10; int a[][] = new int[N][N]; for(i =0;i<N;i++){ a[i][0]=1; a[i][i]=1; } for(i=2;i<N;i++){ for(j=1;j<i;j++){ a[i][j]=a[i-1][j-1]+a[i-1][j]; } } for(i=0;i<N;i++){ for(j=0;j<=i;j++){ System.out.print(a[i][j]+" "); } System.out.print("\n"); } } }
结果: