Leetcode 118. Pascal's Triangle

###Question

Given numRows, generate the first numRows of Pascal’s triangle.

For example, given numRows = 5,
Return

[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]

Code

 public List<List<Integer>> generate(int numRows) {

        List<List<Integer>> results = new ArrayList<>();
        List<Integer> last = new ArrayList<>(0);
        if (numRows < 1) {
            return results;
        }
        results.add(Arrays.asList(1));
        if (numRows == 1) {
            return results;
        }
        for (int i = 2; i <= numRows; i++) {
            List<Integer> tempResults = new ArrayList<>(i);
            tempResults.add(1);
            for (int j = 1; j < i - 1; j++) {
                tempResults.add(last.get(j) + last.get(j - 1));
            }
            tempResults.add(1);
            results.add(tempResults);
            last = tempResults;
        }
        return results;
    }