每日一题 day 44 (DP topic)

最新推荐文章于 2024-11-04 12:20:00 发布

NP_hard

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量103

点赞数

分类专栏： LeetCode Learning 文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/np_hard/article/details/123328323

版权

LeetCode Learning 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

文章目录

problem
my approach

problem

118. Pascal’s Triangle
Given an integer numRows, return the first numRows of Pascal’s triangle.

In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:
在这里插入图片描述

Example 1:

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

Example 2:

Input: numRows = 1
Output: [[1]]

my approach

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> res;
        res.push_back({1});
        for(int i=2; i<=numRows; i++){
            vector<int> tmp = {1};
            for(int j=0; j<i-2; j++)
                tmp.push_back(res[i-2][j]+res[i-2][j+1]);
            tmp.push_back(1);
            res.push_back(tmp);
        }
        return res;
    }
};