Java输出杨辉三角

public static void main(String[] args) {
		int[][] yangHui = new int[8][];//int里代表输出的行数
		// 第i行有(i+1)个元素
		for (int i = 0; i < yangHui.length; i++) {
			yangHui[i] = new int[i + 1];
//			yangHui[i][j]=yangHui[i-1][j]+yangHui[i-1][j-1];
			// 给每行的首末赋值,首末相同
			yangHui[i][0] = yangHui[i][i] = 1;
			// 给除首末的中间的赋值,先确定中间的长度
//			yangHui[i+1][i]=yangHui[i][i-1]+yangHui[i][i];
			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();
		}
	}

输出结果: