Question:
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(n);
暴力法:
递归求得 k-1 时候的数据,然后根据规律求k的数据;
因为有空间复杂度限制,不能直接定义vector<vector<int>>类型,所以只定义一个vector<int>类型即可,刚开始不初始化大小,每从上往下求一行数据,大小加1(push_back()即可);
代码:
<span style="font-size:14px;">class Solution {
public:
vector<int> getRow(int rowIndex) {
//空间复杂度为O(n)第一种方法为4ms
/*vector<int> result;
vector<int> pre;
if(rowIndex == 0){
result.push_back(1);
return result;
}
pre = getRow(rowIndex-1);
result.push_back(1);
for(int i = 0; i < pre.size()-1; i++){
result.push_back(pre.at(i) + pre.at(i+1));
}
result.push_back(1);*/
vector<int> v;
if(rowIndex < 0) return v;
v.push_back(1);
if(!rowIndex) return v;
while(rowIndex--){
v.push_back(0);
for(int i = v.size() - 1; i > 0; i--)
v[i] += v[i-1];
}
return v;
}
};</span>