leetCode刷题归纳-backtracking(39. Combination Sum I && II)

题目描述：39. Combination Sum I

---

Given a set of candidate numbers (C) (without duplicates) and a target
number (T), find all unique combinations in C where the candidate
numbers sums to T.

The same repeated number may be chosen from C unlimited number of
times.

---

Note: All numbers (including target) will be positive integers. The
solution set must not contain duplicate combinations. For example,
given candidate set [2, 3, 6, 7] and target 7, A solution set is: [
[7], [2, 2, 3] ]

将数字组合成制定目标数字的题目，可以重复选择一个数字使用这样子。。。。

解题思路

---

回溯法

class Solution {
public:
    void cbnSum(vector<vector<int>>&res,vector<int>sol,vector<int> candidates,int target,int begin){
        if(target==0) { res.push_back(sol);  return;  }
        for(int i=begin;i<candidates.size()&&target>=candidates[i];i++){
            sol.push_back(candidates[i]);//压栈一个新的candidates
            cbnSum(res,sol,candidates,target-candidates[i],i);//对新的candidate进行处理
            sol.pop_back();//弹出本次压栈的candidate,进行下一步操作
        }

    }


    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>>res;
        vector<int>sol;
        cbnSum(res,sol,candidates,target,0);
        return res;
    }
};

---

————————————————我是分割线——————————————————–

---

题目描述：40. Combination Sum II

---

Given a collection of candidate numbers (C) and a target number (T),
find all unique combinations in C where the candidate numbers sums to
T.

Each number in C may only be used once in the combination.

Note: All numbers (including target) will be positive integers. The
solution set must not contain duplicate combinations.

For example,

given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8, A solution
set is:

[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]

解题思路

---

和上面的区别是，候选数字中有重复的数字，这样在结果中就有可能出现重复，我们只需要在回溯的过程中把过滤规则改一下下

仍然是回溯法：

class Solution {
public:
    void cmb(vector<vector<int>>&res,vector<int>& cdd,vector<int>& sol,int target,int start){
        int tmp=INT_MIN;
        if(target==0) {res.push_back(sol); return;}
        for(int i=start;i<cdd.size()&&cdd[i]<=target;i++){
            if(cdd[i]==tmp) continue;//如果找到了就跳过下面的代码
            sol.push_back(cdd[i]);
            cmb(res,cdd,sol,target-cdd[i],i+1);
            tmp=sol.back();//标记当前状态下最后一个出栈元素
            sol.pop_back();
        }
    }

    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int>sol;
        cmb(res,candidates,sol,target,0);
        return res;
    }
};