题目:
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 == 0)return res;
vector<int> v = { 1 };
res.push_back(v);
if (numRows == 1)return res;
for (int i = 1; i < numRows; i++) {
vector<int> v1 = { 1 };
for (int j = 0; j < i - 1; j++) {
int value = res[i - 1][j] + res[i - 1][j + 1];
v1.push_back(value);
}
v1.push_back(1);
res.push_back(v1);
}
return res;
}
};