Leetcode Pascal's Triangle II
2013-10-27 10:05
375 查看
组合数，从左到右分别是C(n, 0), C(n, 1)……C(n, n)。
注意每次计算的时候记得用long long来存，否则会溢出。
注意每次计算的时候记得用long long来存，否则会溢出。
class Solution {
public:
vector<int> getRow(int rowIndex) {
// Note: The Solution object is instantiated only once and is reused by each test case.
vector<int> ans(rowIndex+1);
for(int i = 0; i <= rowIndex/2; i++){
long long sum = 1;
for(int j = rowIndex, k = 2; j > rowIndex-i; j--){
sum *= j;
for(; k <= i && sum % k == 0; k++)
sum /= k;
}
ans[i] = ans[rowIndex-i] = sum;
}
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
- [leetcode] Pascal's Triangle II
- leetcode 119. Pascal's Triangle II
- [LeetCode] 068: Pascal\'s Triangle II
- LeetCode 119: Pascal's Triangle II
- Leetcode 119 Pascal's Triangle II
- LeetCode119 Pascal's Triangle II
- Leetcode: Pascal's Triangle II
- Pascal's Triangle II--LeetCode
- [leetcode, python] Pascal's Triangle II 杨辉三角
- leetcode-Pascal's Triangle（I、II）
- [LeetCode]119. Pascal's Triangle II
- LeetCode(33)-Pascal's Triangle II
- LeetCode - Pascal's Triangle I && II
- 【Leetcode】119. Pascal's Triangle II
- [LeetCode] Pascal\'s Triangle II
- Leetcode-119. Pascal's Triangle II
- leetcode：Pascal's Triangle II
- [leetcode]Pascal's Triangle II
- LeetCode 119. Pascal's Triangle II