LeetCode 118 :Pascal's Triangle
2015-03-29 20:44
393 查看
push_back() 在vector后添加元素
vector<vector<int> >
二维的vector
当j=0或j=i时
a[i][j]=1
其他时候 a[i][j]=a[i-1][j-1]+a[i-1][j]
vector<vector<int> >
二维的vector
当j=0或j=i时
a[i][j]=1
其他时候 a[i][j]=a[i-1][j-1]+a[i-1][j]
class Solution { public: vector<vector<int> > generate(int numRows) { vector<vector<int>> ans; for(int i = 0;i < numRows;i++) { vector<int> cur; if(i == 0) cur.push_back(1); else { for(int j = 0;j <= i;j++) { if(j == 0 || j == i) cur.push_back(1); else cur.push_back(ans[i - 1][j] + ans[i - 1][j - 1]); } } ans.push_back(cur); } return ans; } };
相关文章推荐
- LeetCode 118 Pascal's Triangle
- [leetCode]118_Pascal's Triangle
- LeetCode---(118)Pascal's Triangle
- leetcode 118 Pascal's Triangle(array)
- LeetCode 118 Pascal's Triangle
- [LeetCode] 118. Pascal's Triangle
- Leetcode刷题记—— 118. Pascal's Triangle(杨辉三角形)
- [leetcode-118]Pascal's Triangle(c++)
- leetcode 118 Pascal's Triangle(难易度:Easy)
- LeetCode 118 Pascal's Triangle(帕斯卡三角形)(vector)
- 杨辉三角(Pascal's Triangle)- LeetCode118-119
- 【LeetCode从零单排】No118 Pascal's Triangle
- leetcode118. Pascal's Triangle
- The Solution to Leetcode 118 Pascal's Triangle
- 【LeetCode-面试算法经典-Java实现】【118-Pascal's Triangle(帕斯卡三角形)】
- Leetcode 118 Pascal's Triangle
- Leetcode 118, Pascal's triangle
- leetCode#118. Pascal's Triangle
- [leetcode] 118. Pascal's Triangle
- (数组)leetcode 118:Pascal's Triangle