回溯+剪枝的简易实现方式,比较典型的39.Combination Sum,在dfs的函数的for循环里面直接加上判断来实现剪枝,同时事先sort来去除重复,这道题目其实非常典型。
void DFS(int st, int num, int target, vector<int>& candidates){
if(num == target){
ans.push_back(path);
return;
}
for(int i=st;i<candidates.size()&&num+candidates[i]<=target;i++){
path.push_back(candidates[i]);
DFS(i, num+candidates[i], target, candidates);
path.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
path.clear();
ans.clear();
sort(candidates.begin(), candidates.end());
DFS(0, 0, target, candidates);
return ans;
}