题目:
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:
Input: candidates = [10, 1, 2, 7, 6, 1, 5], target = 8,
A solution set is:
[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]
Example 2:
Input: candidates = [2, 5, 2, 1, 2], target = 5,
A solution set is:
[
[1, 2, 2],
[5]
]
解答:
这道题与上一题 39 题的区别主要在于两点:
- 本题中原序列 candidates 中包含重复数字。(39题中 candidates 数字无重复)
- 候选中的每个数字在组合中只能使用一次。(39题中数字在组合中可以重复使用)
因此针对以上两点不同,要进行不同的去重处理
- 采用
Arrays.sort(candidates);
对数组 candidates 进行排序,在循环遍历时,若candidates[i] == candidates[i-1]
出现重复数字,则直接 continue - 在遍历到第 i 位时,递归时将标志位 start 改为 i+1,这样就从当前数字的下一位数字进行递归处理,避免数字在组合中重复使用
class Solution {
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
Arrays.sort(candidates);
List<List<Integer>> res = new ArrayList<>();
List<Integer> list = new ArrayList<>();
combinationSum2(res, list, candidates, target, 0);
return res;
}
private void combinationSum2(List<List<Integer>> res, List<Integer> list, int[] candidates, int target, int start) {
if(target == 0) {
res.add(new ArrayList<>(list));
return;
}
if(target < 0) {
return;
}
for(int i=start; i<candidates.length; i++) {
if(i>start && candidates[i] == candidates[i-1]) {
continue;
}
if(candidates[i] <= target) {
list.add(candidates[i]);
combinationSum2(res, list, candidates, target-candidates[i], i+1);
list.remove(list.size()-1);
}
}
}
}