LeetCode 40. 组合总和 II
原题链接
中等
作者:
术
,
2021-11-26 13:28:57
,
所有人可见
,
阅读 223
class Solution {
public:
vector<vector<int>> res;
void dfs(int u,vector<int>& vec,vector<int>& path,int start){
if(u == 0){
res.push_back(path);
return;
}
for(int i = start; i < vec.size(); i++){
if(u - vec[i] < 0) {
break;
}
if(i>start&&vec[i] == vec[i-1]) continue;//如果i不是第一次出现的数,跳过
path.push_back(vec[i]);
dfs(u - vec[i], vec, path, i + 1);
path.pop_back();
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<int> v;
sort(candidates.begin(),candidates.end());
dfs(target,candidates,v,0);
return res;
}
};