119. Pascal's Triangle II

class Solution {
    public List<Integer> getRow(int rowIndex) {
        return generate(rowIndex + 1).get(rowIndex);
    }
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> res = new ArrayList();
        if(numRows == 0) return res;
        res.add(new ArrayList(Arrays.asList(1)));
        for(int i = 2; i <= numRows; i++){
            Integer[] cur = new Integer[i];
            Arrays.fill(cur,1);
           List<Integer> pre = res.get(i-2);
            for(int j = 1; j < i - 1; j++){
                cur[j] = pre.get(j-1) + pre.get(j);
            }
            res.add(new ArrayList(Arrays.asList(cur)));
        }
        return res;
    }
}