118. Pascal's Triangle
2016-11-17 13:49
357 查看
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> v ;
for(int i = 0; i < numRows; ++i){
v.push_back(vector<int>(i+1,1)); //!!!!!!!!!!!!!!!!!!!!!!
for(int j = 1; j < i; ++j){
v[i][j] = v[i-1][j-1] + v[i-1][j];
}
}
return v;
}
};
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> v ;
for(int i = 0; i < numRows; ++i){
v.push_back(vector<int>(i+1,1)); //!!!!!!!!!!!!!!!!!!!!!!
for(int j = 1; j < i; ++j){
v[i][j] = v[i-1][j-1] + v[i-1][j];
}
}
return v;
}
};
相关文章推荐
- leetcode 118: Pascal's Triangle
- 【leetcode c++】118 Pascal's Triangle
- 【LeetCode】118 Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle (python)
- 118. Pascal's Triangle
- leetcode 生成杨辉三角形, 118 119 Pascal's Triangle 1,2
- 118. Pascal's Triangle 容器里放容器(很重要)
- 118. Pascal's Triangle Leetcode Python
- 118. Pascal's Triangle-杨辉三角形
- [C语言][LeetCode][118]Pascal's Triangle
- LeetCode - 118. Pascal's Triangle
- 118. Pascal's Triangle
- Leetcode 118 Pascal's Triangle
- 118. Pascal's Triangle
- 118. Pascal's Triangle
- [Leetcode] 118. Pascal's Triangle 解题报告
- leetcode118 Pascal's Triangle
- The Solution to Leetcode 118 Pascal's Triangle
- LeetCode - 118/119 - Pascal's Triangle