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] ]将该三角形的左边对齐,就能够发现,tri[i][j] = tri[i-1][j-1] + tri[i-1][j]。
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res;
for(int i=0;i<numRows;i++)
{
vector<int> cur;
for(int j=0;j<i+1;j++)
{
if(j==0||j==i)
cur.push_back(1);
else
cur.push_back(res[i-1][j-1]+res[i-1][j]);
}
res.push_back(cur);
}
return res;
}
};