链接：https://leetcode.com/problems/combination-sum-ii/description/
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<vector<int>> res;
vector<int> tmp;
sort(candidates.begin(),candidates.end());
dfs(res,candidates,tmp,target,0,0);
return res;
}
void dfs(vector<vector<int>>& res,vector<int>& candidates,vector<int> tmp,int target,int sum,int start)
{
if(sum==target)
{
vector<int> tmp1(tmp.begin(),tmp.end());
sort(tmp1.begin(),tmp1.end());
if(find(res.begin(),res.end(),tmp1)==res.end())
{
res.push_back(tmp);
}
return;
}
if(sum>target)
{
return;
}
for(int i=start;i<candidates.size();i++)
{
tmp.push_back(candidates[i]);
dfs(res,candidates,tmp,target,sum+candidates[i],i+1);
tmp.pop_back();
}
}
};