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.
- 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] ]
Subscribe to see which companies asked this question
分析:
递归回溯
需要注意的是:
1、在同一层递归树中,如果某元素已经处理并进入下一层递归,那么与该元素相同的值就应该跳过。否则将出现重复。
例如:1,1,2,3
如果第一个1已经处理并进入下一层递归1,2,3
那么第二个1就应该跳过,因为后续所有情况都已经被覆盖掉。
2、相同元素第一个进入下一层递归,而不是任意一个
例如:1,1,2,3
如果第一个1已经处理并进入下一层递归1,2,3,那么两个1是可以同时成为可行解的
而如果选择的是第二个1并进入下一层递归2,3,那么不会出现两个1的解了。
ac代码:
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>>rets;
vector<int>ret;
int n=candidates.size();
if(n==0) return rets;
sort(candidates.begin(),candidates.end());
//candidates.erase(unique(candidates.begin(),candidates.end()),candidates.end());
dfs(rets,ret,candidates,target,n,0,0);
return rets;
}
void dfs(vector<vector<int>>&rets,vector<int>ret,vector<int>candidates,int target,int n,int sum,int index)
{
if(sum==target)
{
rets.push_back(ret);
return;
}
if(sum>target)
return;
for(int i=index;i<n;i++)
{
if(i != index && candidates[i] == candidates[i-1])
continue;
ret.push_back(candidates[i]);
dfs(rets,ret,candidates,target,n,sum+candidates[i],i+1);
ret.pop_back();
}
}
};