Pascal's Triangle
2013-07-06 15:59
162 查看
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;
vector<int> vec1,vec2;
if(numRows==0)return ans;
vec1.push_back(1);
ans.push_back(vec1);
int i,j;
for(i=1;i<numRows;++i){
vec2.resize(i+1);
vec2[0]=vec1[0];
vec2[i]=vec1[i-1];
for(j=1;j<i;++j){
vec2[j]=vec1[j-1]+vec1[j];
}
ans.push_back(vec2);
vec1=vec2;
}
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 118. Pascal's Triangle 杨辉三角 解题报告
- Leetcode-118. Pascal's Triangle
- 帕斯卡三角形—Pascal's Triangle
- Leetcode Pascal's Triangle
- [leetCode]118_Pascal's Triangle
- Leetcode 119. Pascal's Triangle II
- Pascal's Triangle I，II
- LeetCode119. Pascal's Triangle II
- LeetCode119 Pascal's Triangle II
- [leetcode]Pascal's Triangle
- uva 485 Pascal's Triangle of Death
- 118. Pascal's Triangle
- [LeetCode] 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- leetcode 119. Pascal's Triangle II
- Leetcode之Pascal's Triangle 问题
- LeetCode119. Pascal's Triangle II
- 2017.11.14 LeetCode - 118. Pascal's Triangle - 119. Pascal's Triangle II
- Leetcode 118. Pascal's Triangle
- Pascal's Triangle II