杨辉三角

/*
 * 杨辉三角 打印10行
 * 1
 * 1 1
 * 1 2 1
 * 1 3 3 1
 * 1 4 6 4 1
 * ..........*/
public class TestYangHuiSanJiao {
	public static void main(String[] agrs){
		//初始化二维数组
		int[][] yangHui=new int[10][];
		for(int i=0;i<yangHui.length;i++){
			yangHui[i]=new int[i+1];
		}
		for(int i=0;i<yangHui.length;i++){
			for(int j=0;j<yangHui[i].length;j++){
				yangHui[i][0]=yangHui[i][j]=1;
				if(i>1&& j>0 &&j<i){
				yangHui[i][j]=yangHui[i-1][j]+yangHui[i-1][j-1];
				}
			}
		}
		//遍历二维数组
		for(int i=0;i<yangHui.length;i++){
			for(int j=0;j<yangHui[i].length;j++){
				System.out.print(yangHui[i][j]+" ");
				}
			System.out.println();
		}
		
	}

}