如前,浪费时间的地方在于对所得结果的排序。而这个排序可以通过改写在递归过程中实现,从而省去以减少运行时间。
为此,要增加一些参数:
class Solution {
public:
void rec_combinationSum(vector<vector<int>> &res,vector<int> &candidates, int target,int idx,vector<int> &tmp) {
if(target==0)
{res.push_back(tmp);return;}
for(int i=idx;i<candidates.size();++i){
target -=candidates[i];
if(target<0){target +=candidates[i];continue;}
tmp.push_back(candidates[i]);
rec_combinationSum(res,candidates,target,i,tmp);
tmp.pop_back();
target +=candidates[i];
}
}
vector<vector<int> > combinationSum(vector<int> &candidates, int target){
vector<vector<int>> res;
vector<int> tmp;
if(candidates.size()==0) return res;
sort(candidates.begin(),candidates.end());
rec_combinationSum(res,candidates,target,0,tmp);
return res;
}
};
其中有两个恢复操作:
tmp.pop_back();
target +=candidates[i];
这两句能否在递归中让系统实现,从而省去呢?第二句是当然可以的,只要不再程序中修改target的值就可以了,如下:
for(int i=idx;i<candidates.size();++i){
//target -=candidates[i]; 删除这句,把下面的target替换为target-candidates[i];
//if(target<0){target +=candidates[i];continue;}
<span style="white-space:pre"> </span> if(target-candidates[i]<0) continue;
tmp.push_back(candidates[i]);
rec_combinationSum(res,candidates,target-candidates[i],i,tmp);
tmp.pop_back();
//target +=candidates[i];
}
但速度上似乎没有什么提升。就这样吧:
class Solution {
public:
void rec_combinationSum(vector<vector<int>> &res,vector<int> &candidates, int target,int idx,vector<int> &tmp) {
if(target==0)
{res.push_back(tmp);return;}
for(int i=idx;i<candidates.size();++i){
if(target -candidates[i]<0) continue;
//target -=candidates[i];
tmp.push_back(candidates[i]);
rec_combinationSum(res,candidates,target-candidates[i],i,tmp);
tmp.pop_back();
//target +=candidates[i];
}
}
vector<vector<int> > combinationSum(vector<int> &candidates, int target){
vector<vector<int>> res;
vector<int> tmp;
if(candidates.size()==0) return res;
set<int> dedup(candidates.begin(), candidates.end());
candidates = vector<int>(dedup.begin(), dedup.end());
//sort(candidates.begin(),candidates.end());
rec_combinationSum(res,candidates,target,0,tmp);
return res;
}
};
其实不用太追求这些细节,本质的回溯思想才是最重要的。