杨辉三角

杨辉三角效果如下：

总结规律：
yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j];
代码如下：

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];
			yangHui[i][0] = yangHui[i][i] = 1;
			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];
				}
			}
			
		}
		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();
		}

	}

来源：CSDN

作者：塔底的蜗牛

链接：https://blog.csdn.net/zzwz010301/article/details/103482559