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] ]
public class Solution {
public ArrayList<ArrayList<Integer>> generate(int numRows) {
ArrayList<ArrayList<Integer>> listAll = new ArrayList<ArrayList<Integer>>();
if (numRows <= 0) return listAll;
for (int i = 0; i < numRows; i++) {
ArrayList<Integer> list = new ArrayList<Integer>();
if (i == 0) {
list.add(1);
} else {
ArrayList<Integer> prevList = listAll.get(i - 1);
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
list.add(1);
} else {
list.add(prevList.get(j-1) + prevList.get(j));
}
}
}
listAll.add(list);
}
return listAll;
}
}