首页 > 代码库 > LeetCode--Pascal's Triangle

LeetCode--Pascal's Triangle

题目:

技术分享

解决方案:

public class Solution {
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> lists=new ArrayList<List<Integer>>();
        for(int i=0;i<numRows;i++){
            List<Integer> list=new ArrayList<Integer>();
            for(int j=0;j<=i;j++){
                if(j==0||j==i){
                    list.add(1);
                    continue;
                }
                int temp=lists.get(i-1).get(j)+lists.get(i-1).get(j-1);
                list.add(temp);
            }
            lists.add(list);
        }
        return lists;
    }
}


LeetCode--Pascal's Triangle