class Solution {
public:
vector<vector<int> > generate(int numRows) {
vector<vector<int> > res;
int rows=numRows-1;
if(rows<0)
{
return res;
}
vector<int> zero;
zero.push_back(1);
res.push_back(zero);
for(int i=1;i<=rows;++i)
{
vector<int> tmp(i+1);
for(int j=0;j<=i;++j)
{
if(j==0||j==i)
{
tmp[j]=1;
}
else
{
tmp[j]=res[i-1][j-1]+res[i-1][j];
}
}
res.push_back(tmp);
}
return res;
}
};
Pascal's Triangle
最新推荐文章于 2024-10-15 19:28:18 发布