【Leetcode】118. 杨辉三角（Pascal's Triangle）

Leetcode - 118 Pascal’s Triangle (Easy)

Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

public List<List<Integer>> generate(int numRows) {
    List<List<Integer>> res = new ArrayList<>();
    for (int row = 0; row < numRows; row++) {
        List<Integer> tmpList = new ArrayList<>();
        for (int i = 0; i <= row; i++) {
            if (i == 0 || i == row) {
                tmpList.add(1);
            } else {
                int tmp = res.get(row - 1).get(i - 1) + res.get(row - 1).get(i);
                tmpList.add(tmp);
            }
        }
        res.add(tmpList);
    }
    return res;
}