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