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) {
int n=numRows;
vector<vector<int>> ans={};
if(n==0) return ans;
ans={{1}};
if(n==1) return ans;
ans={{1},{1,1}};
if (n==2) return ans;
n=3;
while(n<=numRows){
vector<int> v;
for(int a=-1;a+1<=ans[n-2].size();a++){
if(a==-1||(a+1)==ans[n-2].size()){
v.push_back(1);
}
else
v.push_back(ans[n-2][a]+ans[n-2][a+1]);
}
ans.push_back(v);
n++;
}
return ans;
}
};