LeetCode刷题（C++）—— Pascal's Triangle（Easy）

最新推荐文章于 2020-12-16 15:28:29 发布

YF_Li123

最新推荐文章于 2020-12-16 15:28:29 发布

阅读量492

点赞数

分类专栏： LeetCode题解文章标签： LeetCode C++ Pascals Triangle

本文链接：https://blog.csdn.net/YF_Li123/article/details/72621362

版权

LeetCode题解专栏收录该内容

69 篇文章 1 订阅

订阅专栏

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>> triangle;
		for (int i = 1; i <= numRows;++i) {
			vector<int> v(i);
			int m = 0, n = i - 1;
			int k = 0;
			while (m <= n) {
				if (m == 0) {
					v[m++] = v[n--] = 1;
				}
				else {
					v[m++] = v[n--] = (triangle[i - 2][k] + triangle[i - 2][k + 1]);
					k++;
				}
				
			}
			triangle.push_back(v);
		}
		return triangle;
    }
};