技術標籤：java基礎問題java

輸出一個9行的楊輝三角

public class YangHui {
	public static void main(String[] args) {


		// 構建二維陣列
		//可以改為n行的楊輝三角
		int yanghui[][] = new int[9][];

		//對起始位置賦值
		for (int i = 0; i < yanghui.length; i++) {
					yanghui[i] = new int[i + 1];
					yanghui[i][0]=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();
		}

	}

}