LeetCode 119: Pascal's Triangle II
2015-03-31 20:34
459 查看
循环使用上一行相邻数值相加，需要一个中间变量储存。也可以使用公式，
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> row;
row.push_back(1);
for (int i = 1; i <= rowIndex; ++i)
{
int t = 1, temp;
for (int j = 1; j<i; ++j)
{
temp = t;
t = row[j];
row[j] = temp + row[j];
}
row.push_back(1);
}
return row;
}
};
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> row;
row.push_back(1);
for (int i = 1; i <= rowIndex; ++i)
{
int t = 1, temp;
for (int j = 1; j<i; ++j)
{
temp = t;
t = row[j];
row[j] = temp + row[j];
}
row.push_back(1);
}
return row;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode][119. Pascal's Triangle II][easy]Java实现，杨辉三角
- LeetCode 119. Pascal's Triangle II
- Leetcode#119. Pascal's Triangle II(杨辉三角II）
- 119. Pascal's Triangle II LeetCode
- LeetCode 119. Pascal's Triangle II
- leetcode(34).119. Pascal's Triangle II
- LeetCode-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
- leetcode: (119) Pascal's Triangle II
- [leetcode]#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
- leetcode119~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