Related Topics:Backtracking
这里的重点是去重,重复的是当前position的位置与下一个position位置,而不是在当前position位置后遍历重复的数字
class Solution {
public:vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>> result;
vector<int> temp;
int count=0;
sort(candidates.begin(),candidates.end());
combination(candidates,0,target,temp,result);
return result;
}
void combination(vector<int>& candidates,int count, int target,vector<int>& temp,vector<vector<int>>& result){
if(target==0){
result.push_back(temp);
return;
}
else{
for(int i=count;i<candidates.size();i++){
if(target<0){
return;
}
if(i!=count&&candidates[i]==candidates[i-1]) continue;
temp.push_back(candidates[i]);
combination(candidates,i+1,target-candidates[i],temp,result);
temp.pop_back();
}
}
}
};