119. Pascal's Triangle II
2017-02-27 10:26
357 查看
简单，利用Pascal’s Triangle的对称性，达到O（k）的空间复杂度。
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> result(1,1);
while(rowIndex--)
{
result.push_back(1);
for(int i=result.size()-2;i>=1;i--)
result[i]=result[i]+result[i-1];
}
return result;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 119. Pascal's Triangle II
- [LeetCode]119. Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- Leetcode 119 Pascal's Triangle II
- leetcode 119. Pascal's Triangle II
- leetcode(34).119. Pascal's Triangle II
- 【LeetCode】 119. Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II
- Algorithms—119.Pascal's Triangle II
- leetcode119~Pascal's Triangle II
- LeetCode-119-Pascal's Triangle II-E
- LeetCode119. Pascal's Triangle II-python(easy)
- LeetCode - 119. Pascal's Triangle II
- [LeetCode] 119. Pascal's Triangle II
- 119. Pascal's triangle II Leetcode Python
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- leetcode 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II