Java练习题-杨辉三角

1.声明并初始化二维数组

int[][] yanghui = new int[10][];

2.给数组的元素赋值

for(int i = 0; i < yanghui.length; i++) {
	yanghui[i] = new int[i+1];
			
	//2.1给首末元素赋值
	yanghui[i][0] = yanghui[i][i] = 1;
	//2.2给每行非首末元素赋值
	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 <= i ; j++) {
		System.out.print(yanghui[i][j] + "    ");
	}
	System.out.println();
}

标签：练习题,Java,++,首末,length,yanghui,int,杨辉三角,赋值
来源： https://blog.csdn.net/weixin_46682106/article/details/122514897