题目描述
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 1, a 2, … , a k) must be in non-descending order. (ie, a 1 ≤ a 2 ≤ … ≤ a k).
- The solution set must not contain duplicate combinations.
For example, given candidate set10,1,2,7,6,1,5and target8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
分析:这里和上道题的不同之处在于:这道题中的C会有重复的数字,并且结果中的set只能使用C中的数字一次。
class Solution {
vector<int> d;
vector<vector<int> > result;
set<vector<int> > s;
public:
vector<vector<int> > combinationSum2(vector<int> &num, int target) {
sort(num.begin(),num.end());
dfs(num,0,target,0);
set<vector<int> >::iterator it;
for(it=s.begin();it!=s.end();it++)
result.push_back(*it);
return result;
}
void dfs(vector<int> &num,int sum,int target,int step)
{
if(sum > target || sum < 0)
return;
if(sum == target)
s.insert(d);
else{
for(int i=step;i<num.size();i++)
{
d.push_back(num[i]);
dfs(num, sum+num[i], target, i+1);
d.pop_back();
}
}
}
};