【LeetCode】119. Pascal's Triangle II
2017-07-20 18:22
375 查看
vector<int> getRow(int rowIndex) { vector<int> ans,tmp; ans.push_back(1); if(rowIndex<=0)return ans; for(int i=1;i<=rowIndex;i++) { tmp=ans; ans.clear(); ans.push_back(1); for(int i=0;i<tmp.size()-1;i++) { ans.push_back(tmp[i]+tmp[i+1]); } ans.push_back(1); } return ans; }
相关文章推荐
- ※ Leetcode - Dynamic Programming - 119. Pascal's Triangle II(倒叙滚动数组求解杨辉三角第k行)
- 【leetcode】119. Pascal's Triangle II【java】
- leetcode-118&119 Pascal's Triangle I & II
- leetcode119. Pascal's Triangle II
- LeetCode WIith JS || 119. Pascal's Triangle II
- Leetcode题解 119. Pascal's Triangle II
- Leetcode:119. Pascal's Triangle II(JAVA)
- Leetcode-119. Pascal's Triangle II
- Leetcode 119. Pascal's Triangle II
- 【LeetCode】119 Pascal's Triangle II
- LeetCode119 Pascal's Triangle II
- [LeetCode][119. Pascal's Triangle II][easy]Java实现,杨辉三角
- 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 119. Pascal's Triangle II
- LeetCode 119: Pascal's Triangle II
- Leetcode#119. Pascal's Triangle II(杨辉三角II)
- [LeetCode]119 Pascal's Triangle II