二维数组实现杨辉三角

public class TwoDimensionalArray03 {
    public static void main(String[]args) {
    	//创建一个十行的杨辉三角
    	int[][] yangHui = new int[10][];//二维数组开空间
    	for(int i = 0; i < yangHui.length; i++){
    			yangHui[i] = new int[i+1];//一维数组开空间

    		for(int j = 0; j < yangHui[i].length; j++){
    			if(j == 0 || j == yangHui[i].length - 1){
    				yangHui[i][j] = 1;//每一行的哥最后一个都为1
    			}else{//中间任意一数等于同位置上一行数加上前一位数
    				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();
    	}
    }
}