class Solution {
public:
int sum(vector<int> s){
int cnt = 0;
for(int i=0;i<s.size();i++){
cnt+=s[i];
}
return cnt;
}
void dfs(int level,int target,vector<int>& tmp){
int t = sum(tmp);
if(t==target){
result.push_back(tmp);
return;
}
if(t>target)return;
else{
for(int i=level;i<num.size();i++){
tmp.push_back(num[i]);
dfs(i+1,target,tmp);
tmp.pop_back();
while(i<num.size()-1&&num[i]==num[i+1]) //如果遇到重复,则跳过,比如[1 1 3] 4,[1 3]只应该出现一次
i++;
}
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<int> tmp;
sort(candidates.begin(),candidates.end());
num=candidates;
dfs(0,target,tmp);
return result;
}
private:
vector<int> num;
vector<vector<int>> result;
};
Combination Sum II
最新推荐文章于 2020-12-09 09:11:50 发布