LeetCode Pascal's Triangle

最新推荐文章于 2021-02-16 00:39:16 发布

kassical

最新推荐文章于 2021-02-16 00:39:16 发布

阅读量407

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/kassical/article/details/38568189

版权

LeetCode 专栏收录该内容

98 篇文章 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<vector<int> > iveclist;
		vector<int> ivec = { 1 }, last = { 1, 1 };
		if (numRows <= 0)
			return iveclist;
		else if (numRows == 1) {
			iveclist.push_back(ivec);
			return iveclist;
		}
		else if (numRows == 2) {
			iveclist.push_back(ivec);
			iveclist.push_back(last);
			return iveclist;
		}

		iveclist.push_back(ivec);
		iveclist.push_back(last);
		for (int i = 3; i <= numRows; i++) {
			ivec.clear();
			ivec.push_back(1);
			for (int j = 0; j < last.size() - 1; j++)
				ivec.push_back(last[j] + last[j + 1]);
			ivec.push_back(1);
			iveclist.push_back(ivec);
			last = ivec;
		}
		return iveclist;
	}
};