Pascal's Triangle II
2014-08-06 17:30
169 查看
问题：输出杨辉三角的第n行
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> vec;
int a[100][100];
a[0][0]=1;
int j,i;
for(i=1;i<=rowIndex;i++)
{
a[i][0]=1;
for(j=1;j<i;j++)
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
a[i][j]=1;
}
for(i=0;i<=rowIndex;i++) vec.push_back(a[rowIndex][i]);
return vec;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Pascal's Triangle II leetcode
- 【leetcode刷题笔记】Pascal's Triangle II
- LeetCode OJ——Pascal's Triangle II
- [LeetCode]Pascal's Triangle II
- Leetcode: Pascal's Triangle II
- LeetCode#119 Pascal's Triangle II
- 算法(12)Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- [Leetcode][JAVA] Pascal's Triangle I, II
- (leetcode)Pascal's Triangle II
- LeetCode——Pascal's Triangle II
- Pascal's Triangle II
- 学会从后往前遍历，例 [LeetCode] Pascal's Triangle II，剑指Offer 题4
- [LeetCode] Pascal's Triangle II 杨辉三角之二
- [LeetCode] Pascal's Triangle II
- LeetCode（119） Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle I II