118. 杨辉三角

最新推荐文章于 2022-11-13 11:10:51 发布

INGNIGHT

最新推荐文章于 2022-11-13 11:10:51 发布

阅读量85

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/INGNIGHT/article/details/110789597

版权

leetcode 专栏收录该内容

508 篇文章 1 订阅

订阅专栏

链接：118. 杨辉三角

题解：https://leetcode-cn.com/problems/pascals-triangle/solution/yang-hui-san-jiao-by-leetcode-solution-lew9/

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

class Solution {
    public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> result(numRows);
        if(numRows <= 0) {
            // RVO
            return result;
        }
        for(int i = 1; i <= numRows; ++i) {
            vector<int> ceng;
            ceng.resize(i);
            ceng[0] = 1;
            ceng[i-1] = 1;
            if(i == 1 || i == 2) {
                result[i-1] = ceng;
                continue;
            }
            for(int j = 1; j < i-1; ++j) {
                ceng[j] = result[i-2][j-1] + result[i-2][j];
            }
            result[i-1] = std::move(ceng);
        }
        // RVO
        return result;
    }
};