原题目:
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?
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> v(rowIndex + 1);
if(rowIndex < 0)
return v;
v[0] = 1;
for(int i = 0;i <= rowIndex;i++)
{
for(int j = i;j > 0;j--)
v[j] = v[j] + v[j-1];
}
return v;
}
};