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?
输出杨辉三角第K行,只能用k的额外空间。
滚动数组的思想,为了方便就没用标准的滚动数组了,慢了一点。
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> res(1,1);
for(int i=1;i<=rowIndex;i++)
{
vector<int> temp=res;
for(int j=0;j<res.size()-1;j++) temp[j+1]=res[j]+res[j+1];
res=temp;
res.push_back(1);
}
return res;
}
};