地址:https://leetcode.com/problems/combination-sum-ii/
题目:
Given a collection of candidate numbers (candidates
) and a target number (target
), find all unique combinations in candidates where the candidate numbers sums to target
.
Each number in candidates
may only be used once in the combination.
Note:
- All numbers (including
target
) will be positive integers. - The solution set must not contain duplicate combinations.
Example 1:
Example 2:
理解:
是39 Combination Sum的后续。区别在于,本题不能重复使用元素,但是集合有重复元素。
和上一题的思想是一样的,需要修改一些实现。
首先,不能重复使用,递归调用的时候取begin+1而不是begin就可以避免重复使用。
对于重复结果,仅当元素在集合中首次出现的时候才添加并递归调用即可。
实现:
Accepted 16ms c++ solution use backtracking, easy understand.
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
vector<vector<int>> res;
vector<int> combination;
combinationSum(candidates, res, target, combination, 0);
return res;
}
void combinationSum(vector<int>& candidates, vector<vector<int>>& res, int target, vector<int>& combination, int begin) {
if (!target) {
res.push_back(combination);
return;
}
for (int i = begin; i < candidates.size() && target >= candidates[i]; ++i) {
//avoid repeated res
if (i == begin || candidates[i] != candidates[i - 1]) {
combination.push_back(candidates[i]);
// i+1 avoid repeatedly using element in the candidates
combinationSum(candidates, res, target - candidates[i], combination, i + 1);
combination.pop_back();
}
}
}
};