题目:
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Example:
Input: 5
Output:
[
[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>> res;
if(numRows < 1)
return res;
for(int i = 0; i<numRows; i++)
{
vector<int> cur;
for(int j = 0; j<i+1; j++)
{
if(j == 0 || j == i)
cur.push_back(1);
else
{
int sum = res[res.size() - 1][j - 1] + res[res.size() - 1][j];
cur.push_back(sum);
}
}
res.push_back(cur);
}
return res;
}
};