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>> vec;
for(int i=0;i<numRows;i++)
{
vector<int> vec1;
if(i==0) vec1.push_back(1);
else
{
for(int j=0;j<=i;j++)
{
if(j==0||j==i) vec1.push_back(1);
else vec1.push_back(vec[i-1][j-1]+vec[i-1][j]);
}
}
vec.push_back(vec1);
}
return vec;
}
};