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] ]
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> p_triangle;
for(int i=0;i<numRows;i++){
vector<int> level(i+1,1);
if(numRows>2&&i>1){
for(int j=1;j<i;j++)
level[j] = p_triangle[i-1][j-1] + p_triangle[i-1][j];
}
p_triangle.push_back(level);
}
return p_triangle;
}
};