Pascal's Triangle -leetcode

最新推荐文章于 2019-05-03 11:56:08 发布

spkang

最新推荐文章于 2019-05-03 11:56:08 发布

阅读量675

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/spkang/article/details/12320171

版权

leetcode 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Pascal's Triangle

AC Rate: 867/2595

My Submissions

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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if (numRows < 1)
            return vector<vector <int> >();
        vector<vector<int> > ans;
        vector<int> v1(1, 1);
        vector<int> v2(2, 1);
        ans.push_back(v1);
        if (numRows == 1)
            return ans;
        ans.push_back(v2);
        if (numRows == 2)
            return ans;
        for (int i = 2; i < numRows; ++i ) {
            vector<int> vi(i + 1, 1);
            for (int j = 1; j < i; ++j) {
                vi.at(j) = ans.at(i-1).at(j-1) + ans.at(i-1).at(j);
            }
            ans.push_back(vi);
        }
        return ans;
    }
};