LeetCode 118.Pascal's Triangle

最新推荐文章于 2019-10-22 15:00:13 发布

wuqingdeqing

最新推荐文章于 2019-10-22 15:00:13 发布

阅读量228

点赞数

分类专栏：算法学习笔记文章标签： LeetCode 刷题算法

本文链接：https://blog.csdn.net/wuqingdeqing/article/details/80826521

版权

算法学习笔记专栏收录该内容

50 篇文章 0 订阅

订阅专栏

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.

In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 5
Output:
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]

此题逻辑不复杂，需注意运算时数组不要越界即可。Accepted代码如下：

class Solution {
    public List<List<Integer>> generate(int numRows) {
        List<List<Integer>> outList = new ArrayList<>();
        List<Integer> beforeList = new ArrayList<>();
        for (int i = 0; i < numRows; i++) {
            List<Integer> inList = new ArrayList<>();
            inList.add(1);
            if (i > 1) {
                for (int j = 1; j < i; j++) {
                    inList.add(beforeList.get(j - 1) + beforeList.get(j));
                }
            }
            if (i > 0) {
                inList.add(1);
            }
            outList.add(inList);
            beforeList.clear();
            beforeList.addAll(inList);
        }
        return outList;
    }
}