[Leetcode] 118. Pascal's Triangle

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]
]

import java.util.ArrayList;
public class Solution {
    public ArrayList<ArrayList<Integer>> generate(int numRows) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(numRows <= 0) return result;
        ArrayList<Integer> prev = new ArrayList<Integer>();
        prev.add(1);
        result.add(prev);
        for(int i = 1; i < numRows; i++){
            ArrayList<Integer> current = new ArrayList<Integer>();
            current.add(1);
            for(int j = 0; j < prev.size() - 1; j++){
                current.add(prev.get(j) + prev.get(j + 1));
            }
            current.add(1);
            result.add(current);
            prev = current;
        }
        return result;
    }
}