119. Pascal's Triangle II
2017-06-06 17:24
260 查看
题意：求杨辉三角的某一层。
思路：利用二项式组合公式，在O（n*n）内解决。
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> A(rowIndex+1, 0);
A[0] = 1;
for(int i=1; i<rowIndex+1; i++)
for(int j=i; j>=1; j--)
A[j] += A[j-1];
return A;
}
};
思路：利用二项式组合公式，在O（n*n）内解决。
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> A(rowIndex+1, 0);
A[0] = 1;
for(int i=1; i<rowIndex+1; i++)
for(int j=i; j>=1; j--)
A[j] += A[j-1];
return A;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode - 119. Pascal's Triangle II
- Leetcode_c++： Pascal's TriangleII (119)
- 【leetcode】119. Pascal's Triangle II
- LeetCode119 Pascal's Triangle II
- [Leetcode]#119 Pascal's Triangle II
- 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
- 【Leetcode】119. Pascal's Triangle II
- leetcode-119. Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II
- [LeetCode By Python]119. Pascal's Triangle II
- leetcode刷题记录-119. Pascal's Triangle II
- [Leetcode]119. Pascal's Triangle II
- The Solution to Leetcode 119 Pascal's Triangle II
- 【LeetCode】119 Pascal's Triangle II
- Leetcode-119. Pascal's Triangle II