原题:
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] ]
一行一行求杨辉三角并且都保存在一个二维vector容器中,没什么可说的,结果:
Success
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Pascal's Triangle.
Memory Usage: 8.8 MB, less than 49.32% of C++ online submissions for Pascal's Triangle.
代码:
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> r;
if(numRows==0){return r;}
vector<int> init;
r.push_back(init);
r[0].push_back(1);
for(int i=0;i<numRows-1;i++){
init.push_back(1);
for(int j=1;j<i+1;j++){
init.push_back(r[i][j-1]+r[i][j]);
}
init.push_back(1);
r.push_back(init);
init.clear();
}
return r;
}
};