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.
• Elements in a combination (a₁, a₂, … , a_k) must be in non-descending order. (ie, a₁ ≤ a₂ ≤ … ≤ a_k).
• 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]

代码：

// static map<vector<int>,int> m1;
class Solution {
public:

    void build(int t,int target,int sum,vector<vector<int>> &v1, vector<int> v2,vector<int> candidates,map<vector<int>,int>& m1)
    {
        if(sum==target)
       {  if(m1[v2]==0)v1.push_back(v2);  m1[v2]++; }
        else
        for(int i=t;i<candidates.size();++i)
        {
            v2.push_back(candidates[i]);
            if((sum+candidates[i])<=target) build(i+1,target,sum+candidates[i],v1,v2,candidates,m1);
            v2.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        map<vector<int>,int> m1;
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> v1;
        vector<int> v2;
        int sum=0;
        for(int i=0;i<candidates.size();++i)
        {
            v2.push_back(candidates[i]);
            if(candidates[i]<=target) build(i+1,target,candidates[i],v1,v2,candidates,m1);
            v2.pop_back();
        }
        return v1;
    }
};