118. Pascal's Triangle

最新推荐文章于 2021-10-29 10:30:05 发布

zhouyanz

最新推荐文章于 2021-10-29 10:30:05 发布

阅读量149

点赞数

分类专栏： Leetcode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/zhouyanz/article/details/50926644

版权

Leetcode 专栏收录该内容

196 篇文章 0 订阅

订阅专栏

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

Subscribe to see which companies asked this question

public class Solution {
    private List<Integer> listCreater (List<Integer> a){
        // int [] ret = new int [a.length+1];
        List <Integer> ret =new ArrayList <Integer> ();
        ret.add(1);
        // ret[0]=1;
        // ret[a.length]=1;
        for(int i=1;i<a.size();i++){
            ret.add(a.get(i)+a.get(i-1));
        }
        ret.add(1);
        return ret;
    }
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> ret  = new ArrayList<List<Integer>> ();
      
        List <Integer> orgin =new ArrayList <Integer> ();
        orgin.add(1);
        for(int i = 1;i<=numRows;i++){
            ret.add(orgin);
            orgin=listCreater(orgin);
        }
        return ret;
    }
}