上图和以下代码思路来源于尚硅谷JAVA【侵删】
尚硅谷官网
public class YangHuiTest {
public static void main(String[] args) {
//1.声明并且初始化二维数组
int[][] yangHui = new int[10][];
//2.给数组元素赋值
for(int i = 0;i < yangHui.length; i++){
//2.0第n行有n列
yangHui[i] = new int[i+1];
//2.1首末元素都为1
yangHui[i][0] = yangHui[i][i] = 1;
//2.2非首末元素值为上方与左上方的加和
if(i>1){
for(int j = 1;j < yangHui[i].length - 1;j++){
yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j];
}
}
}
//3.遍历二维数组并输出
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();
}
}
}