# 数字组合sum 不可以重复并且去重复

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

Each number in candidates 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.

Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]


Example 2:

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
[1,2,2],
[5]
]

class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<int> ivec;
vector<vector<int> > res;
set<vector<int> > z;
sort(candidates.begin(),candidates.end());
dfs(candidates,0,target,ivec,z);

set<vector<int> >::iterator iter;
for(iter=z.begin();iter!=z.end();++iter){
res.push_back(*iter);
}
return res;

}

//
void dfs(vector<int> &condidates, int k,int target,vector<int> temp,set<vector<int> > &res){
if(target==0){
res.insert(temp);
return ;
}else if(target<0){
return ;
}

for(int i=k;i<condidates.size();++i){
temp.push_back(condidates[i]);
dfs(condidates,i+1,target-condidates[i],temp,res);
temp.pop_back();
}
return ;
}
};