LeetCode-Pascal's Triangle II
2013-08-16 18:05
302 查看
class Solution {
public:
vector<int> getRow(int rowIndex) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> ans(rowIndex + 1, 0);
ans[0] = 1;
for (int i = 0; i < rowIndex; ++i)
{
int pre = 1;
int cur;
for (int j = 1; j <= i + 1; ++j)
{
cur = ans[j];
ans[j] += pre;
pre = cur;
}
}
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode——Pascal's Triangle II
- (LeetCode)Pascal's Triangle --- 杨辉三角
- [leetcode] Pascal's Triangle
- leetcode 日经贴，Cpp code -Pascal's Triangle
- leetcode--Pascal's Triangle
- Pascal's Triangle -leetcode
- 【LeetCode】Pascal's Triangle (杨辉三角)
- leetcode——118—— Pascal's Triangle
- [LeetCode] Pascal's Triangle II
- leetcode Pascal's Triangle
- leetcode - Pascal's Triangle
- 【LeetCode-面试算法经典-Java实现】【118-Pascal's Triangle（帕斯卡三角形）】
- [LeetCode]Pascal's Triangle
- [leetcode]Pascal's Triangle
- 【LeetCode】119_Pascal's Triangle II
- 【LeetCode刷题记录】Pascal's Triangle II
- LeetCode 118 Pascal's Triangle
- [LeetCode]Pascal's Triangle
- 【LeetCode】Pascal's Triangle
- Pascal's Triangle--LeetCode