class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> result(rowIndex + 1);
result[0] = 1;
for (int i = 1; i <= rowIndex; i++)
{
for (int j = i; j >= 0; j--)
{
if (j == i)
{
result[j] = result[j - 1];
}
else if (j == 0)
{
result[j] = result[j];
}
else
{
result[j] = result[j - 1] + result[j];
}
}
}
return result;
}
};
【LeetCode】Pascal's Triangle II
最新推荐文章于 2019-06-24 19:31:47 发布