java输出杨辉三角

//声明初始化二维数组
int[][] yangHui = new int[10][];
//给数组赋值
for(int i=0;i<yangHui.length;i++){
    //遍历每一行时给这一行初始化列数
    yangHui[i] = new int[i+1];
    
    //给首末元素赋值1
    yangHui[i][0] = yangHui[i][i] = 1;

    //给非首末元素赋值
    for(int j=1;j<yangHui[i].length-1;j++){
        yangHui[i][j] = yangHui[i-1][j] + yangHui[i-1][j-1];
    }
}
//遍历二维数组
for(int i=0;i<yangHui.length;i++){
    for(int j=1;j<yangHui[i].length;j++){
        System.out.print(yangHui[i][j]+" ");
    }
    System.out.println();
}