Pascal's Triangle

最新推荐文章于 2024-07-10 10:03:05 发布

随心而动随意而行

最新推荐文章于 2024-07-10 10:03:05 发布

阅读量450

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013009575/article/details/18960809

版权

leetcode 专栏收录该内容

50 篇文章 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]
]

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

};