Pascal's Triangle II
2014-02-08 15:48
232 查看
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
求帕斯卡三角的第n行。
这里有个规律:row
[j]+=row[n-1][j-1]
然后后面再补一个1就得到新的行。
vector<int> getRow(int n)
{
vector<int> row;
if (n<0)
return row;
for(int i=0; i<=n; i++)
{
for(int j=i-1; j>=1; j--)
row[j]+=row[j-1];
row.push_back(1);
}
return row;
}
For example, given k = 3,
Return [1,3,3,1].
Note:
Could you optimize your algorithm to use only O(k) extra space?
求帕斯卡三角的第n行。
这里有个规律:row
[j]+=row[n-1][j-1]
然后后面再补一个1就得到新的行。
vector<int> getRow(int n)
{
vector<int> row;
if (n<0)
return row;
for(int i=0; i<=n; i++)
{
for(int j=i-1; j>=1; j--)
row[j]+=row[j-1];
row.push_back(1);
}
return row;
}
相关文章推荐
- [LeetCode]119 Pascal's Triangle II
- Pascal's Triangle II --杨辉三角形-链表和数组
- Pascal's Triangle II
- [Leetcode从零开刷]119. Pascal's Triangle II
- Pascal's Triangle II
- 119. Pascal's Triangle II
- 119. Pascal's Triangle II(unsolved)
- 119. Pascal's Triangle II Python
- Leetcode 119. Pascal's Triangle II
- LeetCode力扣之119. Pascal's Triangle II
- [Array]Pascal's Triangle II
- Pascal's Triangle II (Java)
- Pascal's Triangle II
- Pascal's Triangle II
- 119. Pascal's Triangle II*
- 119. Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Leetcode 第119题 Pascal's Triangle II
- 【LeetCode】119.Pascal Triangle II