Java实现杨辉三角

代码实现

package day01;

public class yanghui {
	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] = 1;// 首位置
			yanghui[i][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();
		}
	}
}