Java小練習 輸出一個十行的楊輝三角

用二維數組輸出一個10行的楊輝三角:
1
11
121
1331
14641
.......
通過觀察，不難得到對於楊輝三角中，每行的首，末位元素均為1，而中間的元素yangHui[i][j]=yangHui[i-1][j-1]+yangHui[i-1][j]
所以可以先建立一個二維數組，再按照這種規律依次賦值，最后遍歷一遍即可

public class yangHuiTriangle {
    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];
        }
        //給二維數組賦值
        for (int i = 0; i < yangHui.length; i++) {
            //先給邊上的賦值
            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();
        }
    }
}