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