class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res;
for(int i=0;i<numRows;i++){
vector<int> cur{1};
if(!i){
res.push_back(cur);
}
else{
for(auto it=res[res.size()-1].begin();it!=res[res.size()-1].end()-1;it++){
cur.push_back(*it+*(it+1));
}
cur.push_back(1);
res.push_back(cur);
}
}
return res;
}
};
LeetCode - 118 Pascal's Triangle
最新推荐文章于 2024-05-25 16:17:00 发布