39.Combination Sum
像这种结果要求返回所有符合要求解的题十有八九都是要利用到递归,而且解题的思路都大同小异,相类似的题目有 Path Sum II 二叉树路径之和之二,Subsets II 子集合之二,Permutations 全排列,Permutations II 全排列之二,Combinations 组合项等等,如果仔细研究这些题目发现都是一个套路,都是需要另写一个递归函数,这里我们新加入三个变量,start记录当前的递归到的下标,out为一个解,res保存所有已经得到的解,每次调用新的递归函数时,此时的target要减去当前数组的的数,具体看代码如下:
class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<int> out;
vector<vector<int>> res;
sort(candidates.begin(), candidates.end());
dfs(candidates, res, out, 0, target);
return res;
}
void dfs(vector<int>& candidates, vector<vector<int>> &res, vector<int> out, int start, int target) {
if(target < 0) return; // dfs先写返回状态
else if(target == 0) res.push_back(out);
else {
for(int i = start; i < candidates.size(); ++i) {
out.push_back(candidates[i]); // 将可能存在的解存入out中
dfs(candidates, res, out, i, target - candidates[i]); // 递归调用,更新target
out.pop_back();
}
}
return; // 养成习惯,最后写返回
}
};
40.Combination Sum II
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>> res;
vector<int> out;
sort(candidates.begin(), candidates.end());
dfs(candidates, res, out, 0, target);
return res;
}
void dfs(vector<int> &candidates, vector<vector<int>> &res, vector<int> &out, int start, int target) {
if(target < 0) return;
else if(target == 0 && find(res.begin(), res.end(), out) == res.end()) res.push_back(out); // 加入res前检查是否存在相同排列
else {
for(int i = start; i < candidates.size(); ++i) {
out.push_back(candidates[i]);
dfs(candidates, res, out, i+1, target - candidates[i]);
out.pop_back();
}
}
return;
}
};