给定一个候选人编号的集合
candidates
和一个目标数target
,找出candidates
中所有可以使数字和为target
的组合。
candidates
中的每个数字在每个组合中只能使用 一次 。注意:解集不能包含重复的组合。
示例 1:
输入: candidates =[10,1,2,7,6,1,5]
, target =8
, 输出: [ [1,1,6], [1,2,5], [1,7], [2,6] ]示例 2:
输入: candidates = [2,5,2,1,2], target = 5, 输出: [ [1,2,2], [5] ]提示:
1 <= candidates.length <= 100
1 <= candidates[i] <= 50
1 <= target <= 30
上一道题拿来改改即可
就是耗时有点长。
class Solution {
public:
vector<vector<int>> res;
vector<int> cur_res;
void dfs(vector<int>& candidates, int cur_num, int cur_idx) {
if (cur_num < 0) return;
if (cur_num == 0) {
vector<int> temp(cur_res);
res.push_back(temp);
}
if (cur_idx == candidates.size()) return;
cur_idx++;
for (int i = cur_idx; i < candidates.size(); i++) {
if(i != cur_idx && candidates[i] == candidates[i-1])continue;
cur_res.push_back(candidates[i]);
dfs(candidates, cur_num - candidates[i], i);
cur_res.pop_back();
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
dfs(candidates, target, -1);
return res;
}
};