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