40. 组合总和 II
给定一个候选人编号的集合 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:
void backtrack(vector<int>& candidates, int target, vector<int>& combination, vector<vector<int>>& combinations, vector<bool>& used, int start) {
int cursum = accumulate(combination.begin(), combination.end(), 0);
if (cursum == target) {
combinations.push_back(combination);
return;
}
if (cursum < target) {
for (int i = start; i < candidates.size(); i++) {
if (used[i] || (i > start && !used[i - 1] && candidates[i] == candidates[i - 1])) {
continue;
}
combination.push_back(candidates[i]);
used[i] = true;
backtrack(candidates, target, combination, combinations, used, i);
combination.pop_back();
used[i] = false;
}
} else {
return;
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>> combinations;
vector<int> combination;
vector<bool> used(candidates.size(), false);
sort(candidates.begin(), candidates.end());
backtrack(candidates, target, combination, combinations, used, 0);
return combinations;
}
};