问题:
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
Note:
Could you optimize your algorithm to use only O(k) extra space?
思路: 只用一个o(k)大小的数组即可,每层更新数据。
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> numbers(rowIndex + 1);
numbers[0] = 1;
numbers[rowIndex] = 1;
for(int i = 0; i <= rowIndex; i++)
{
int temp = 1;
for(int j = 1;j < i; j++)
{
int new_number = temp + numbers[j];
temp = numbers[j];
numbers[j] = new_number;
}
numbers[i] = 1;
}
return numbers;
}
};