LeetCode 119. Pascal's Triangle II
2017-05-11 15:46
429 查看
119. Pascal’s Triangle II
Given an index k, return the kth row of the Pascal’s triangle.
Given an index k, return the kth row of the Pascal’s triangle.
class Solution { public: vector<int> getRow(int rowIndex) { vector<int> ANS; ANS.push_back(1); long long ans = 1, a = rowIndex, b = 1; while(a >=1 ) { ans *= a; ans /= b; a--; b++; ANS.push_back((int)ans); } return ANS; } };
相关文章推荐
- The Solution to 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
- 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 WIith JS || 119. Pascal's Triangle II
- Leetcode#119. Pascal's Triangle II(杨辉三角II)
- [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 (返回杨辉三角指定行)
- [LeetCode By Python]119. Pascal's Triangle II
- [Leetcode] 119. Pascal's Triangle II 解题报告