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>> ans; ans.resize(numRows); //重新分配大小,改变容器大小,并创建对象 for(int i=0;i<numRows;i++){ ans[i].assign(i+1,1); } for(int i=2;i<numRows;i++) for(int j=1;j<i;j++) ans[i][j]=ans[i-1][j-1]+ans[i-1][j];