Pascal's Triangle

import java.util.ArrayList;
import java.util.List;

public class Solution {
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> listList = new ArrayList<List<Integer>>();//notice "new"
        for(int i = 1; i <= numRows; i++){
            List<Integer> intList = new ArrayList<Integer>();
            for(int j = 1; j <= i; j++){
                if(j == 1){//the first element of every row
                    intList.add(1);
                }
                else if(j > 1 && j < i){//the element between the first element and the last element
                    intList.add(listList.get(i - 2).get(j - 2) + listList.get(i - 2).get(j - 1));
                }
                else if((j == i) && (j != 1)){//the last element of every row(begin with the second row)
                    intList.add(1);
                }

            }
            listList.add(intList);
        }
        return listList;
    }
}