class Solution {
public:
vector<vector<int> >ans;
vector<int>path;
set<vector<int> > st;
void dfs(vector<int>& candidates,int startindex,int target,int sum,vector<bool>& used){
if(sum>target)return;
if(sum==target){
ans.push_back(path);
return;
}
for(int i=startindex;i<candidates.size();i++){
if(i>0&&candidates[i]==candidates[i-1]&&used[i-1]==false){
continue;
}
sum+=candidates[i];
path.push_back(candidates[i]);
used[i]=true;
dfs(candidates,i+1,target,sum,used);
used[i]=false;
sum-=candidates[i];
path.pop_back();
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<bool>used(candidates.size(),false);
sort(candidates.begin(),candidates.end());
dfs(candidates,0,target,0,used);
return ans;
}
};
40. 组合总和 II
最新推荐文章于 2024-08-09 20:36:57 发布