1.题目
2.解法
①集合+dfs
class Solution {
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
List<List<Integer>> res = new ArrayList<>();
List<Integer> temp = new ArrayList<>();
boolean[] used = new boolean[candidates.length];
Arrays.sort(candidates);
dfs(0, res, temp, used, candidates, target);
return res;
}
private void dfs(int start, List<List<Integer>> res, List<Integer> temp, boolean[] used, int[] candidates, int target){
if(target == 0){
res.add(new ArrayList<>(temp));
return;
}
for(int i = start; i < candidates.length; i++){
if(i != 0 && candidates[i] == candidates[i - 1] && !used[i - 1]){
continue;
}
if(candidates[i] <= target){
temp.add(candidates[i]);
used[i] = true;
dfs(i + 1, res, temp, used, candidates, target - candidates[i]);
temp.remove(temp.size() - 1);
used[i] = false;
}
}
}
}