题目
Given a collection of candidate numbers (
candidates
) and a target number (target
), find all unique combinations incandidates
where the candidate numbers sums totarget
.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] ]
解题思路
本题和leetcode 39题思路基本一样,不同有以下两点
1、本题有重复节点
2、每个节点元素只能用一次,例如给出的数组中有两个2,则结果中最多有两个2存在,三个2的情况就不符合要求
代码实现
public class Main {
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
List<List<Integer>> res = new ArrayList<>();
if (candidates == null || candidates.length == 0 || target < 0) return res;
List<Integer> list = new ArrayList<>();
Arrays.sort(candidates); //排序,使得寻找相同出权值的节点变得容易
get(candidates, target, 0, list, res);
return res;
}
private void get(int[] candidates, int target, int i, List<Integer> list, List<List<Integer>> res) {
if (i > candidates.length || target < 0) return; //因为没有自环,所以每次都是从下一个节点开始搜索,要添加一个条件判断节点仍在图中
if (target == 0) { //满足条件,添加至结果集
res.add(new ArrayList<>(list));
return;
}
for (int p = i; p < candidates.length; p++) {
list.add(candidates[p]); //添加节点到路径
get(candidates, target - candidates[p], p + 1, list, res); //因为没有自环,所以每次搜索更新路径权值后的下一个节点
list.remove(list.size() - 1); //回溯,将当前节点从路径中剔除
while (p < candidates.length - 1 && candidates[p] == candidates[p + 1]) p++; //因为存在重复节点,所以已经被剔除的节点不能再被放回到路径中
}
}
}