class Solution {
public:
vector<vector<int> > generate(int numRows) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > ans;
ans.resize(numRows);
for(int i = 0; i < numRows; ++i)
ans[i].assign(i+1, 1);
//
for(int i = 0; i < numRows; ++i)
{
for(int j = 1; j <= i-1; ++j)
ans[i][j] = ans[i-1][j-1]+ans[i-1][j];
}
//
return ans;
}
};
[LeetCode]Pascal's Triangle
最新推荐文章于 2021-02-16 00:39:16 发布