题目:
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> level;
if(rowIndex < 0)
return level;
for(int i = 0; i <= rowIndex; i++) {
int pre_sz = level.size();
for(int j = pre_sz-1; j >= 1; j--)
level[j] += level[j-1];
level.push_back(1);
}
return level;
}
};