<p>Given a collection of candidate numbers (<code>candidates</code>) and a target number (<code>target</code>), find all unique combinations in <code>candidates</code>&nbsp;where the candidate numbers sum to <code>target</code>.</p>

<p>Each number in <code>candidates</code>&nbsp;may only be used <strong>once</strong> in the combination.</p>

<p><strong>Note:</strong>&nbsp;The solution set must not contain duplicate combinations.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> candidates = [10,1,2,7,6,1,5], target = 8
<strong>Output:</strong> 
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> candidates = [2,5,2,1,2], target = 5
<strong>Output:</strong> 
[
[1,2,2],
[5]
]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;=&nbsp;candidates.length &lt;= 100</code></li>
	<li><code>1 &lt;=&nbsp;candidates[i] &lt;= 50</code></li>
	<li><code>1 &lt;= target &lt;= 30</code></li>
</ul>

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> tmp_vec;
        sort(candidates.begin(),candidates.end());
        getPossiableCombine(res,candidates,target,tmp_vec,0);
        set<vector<int>> res_set(res.begin(),res.end());
        res.assign(res_set.begin(),res_set.end());
        return res;
    }
private:
    void getPossiableCombine(vector<vector<int>>& res, vector<int>& candidates, int target,
            vector<int> tmp_vec, int index){
        if(target == 0){
            res.push_back(tmp_vec);
            return;
        }
        if(index >= candidates.size())
            return;

        for(int i= index;i<candidates.size();i++)
        {
            if(i>index && candidates[i] == candidates[i-1])
                continue;
            if(candidates[i] > target)
                break;
            tmp_vec.push_back(candidates[i]);
            getPossiableCombine(res,candidates, target-candidates[i],tmp_vec,i+1);
            tmp_vec.pop_back();
        }
    }
};
14546