118. Pascal's Triangle
2017-07-24 09:51
344 查看
题目:
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
思路:
Pascal三角形,每一行除首尾为1外其余均为上一样相邻两数的和
代码:
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res(0);
vector<int> ress;
if(numRows==0)
return res;
ress.push_back(1);
res.push_back(ress);
for(int i=2;i<=numRows;i++)
{
vector<int> temp;
temp.push_back(1);
for(int j = 0;j<ress.size()-1;j++)
{
temp.push_back(ress[j]+ress[j+1]);
}
temp.push_back(1);
res.push_back(temp);
ress = temp;
}
return res;
}
};
Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return
[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
思路:
Pascal三角形,每一行除首尾为1外其余均为上一样相邻两数的和
代码:
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res(0);
vector<int> ress;
if(numRows==0)
return res;
ress.push_back(1);
res.push_back(ress);
for(int i=2;i<=numRows;i++)
{
vector<int> temp;
temp.push_back(1);
for(int j = 0;j<ress.size()-1;j++)
{
temp.push_back(ress[j]+ress[j+1]);
}
temp.push_back(1);
res.push_back(temp);
ress = temp;
}
return res;
}
};
相关文章推荐
- 118. Pascal's Triangle
- LeetCode - 118/119 - Pascal's Triangle
- [leetcode]#118. Pascal's Triangle
- leetCode#118. Pascal's Triangle
- 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
- 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:Pascal's Triangle (生成指定行数的杨辉三角)
- 118. Pascal's Triangle
- 118. Pascal's Triangle -- Python