vector<int> getRow(int rowIndex)
{
vector<int> res(1, 1);
if(rowIndex < 1)
return res;
vector<int> lastrow;
for(int i = 0; i < rowIndex; i++)
{
lastrow = res;
for(int j = 1; j < i + 1; j++)
res[j] = lastrow[j - 1] + lastrow[j];
res.push_back(1);
}
return res;
}
LeetCode : Pascal's Triangle II
最新推荐文章于 2018-11-07 09:09:42 发布