算法：帕斯卡三角

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