Leetcode(Java)-40. 组合总和 II

给定一个数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

candidates 中的每个数字在每个组合中只能使用一次。

说明：

所有数字（包括目标数）都是正整数。
解集不能包含重复的组合。 
示例 1:

输入: candidates = [10,1,2,7,6,1,5], target = 8,
所求解集为:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]
示例 2:

输入: candidates = [2,5,2,1,2], target = 5,
所求解集为:
[
  [1,2,2],
  [5]
]

思路：在上一题的基础上，增加不可重用+结果去重的条件

利用HashSet去重

class Solution {
    List<List<Integer>> res = new LinkedList<>();
    HashSet<List<Integer>> set = new HashSet<>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        LinkedList<Integer> track = new LinkedList<>();
        Arrays.sort(candidates);
        trackback(candidates,0,target,track);
        return res;
    }
    private void trackback(int[] candidates , int start ,int target ,LinkedList<Integer> track){
        if(target == 0)
        {
            if(!set.contains(new LinkedList<Integer>(track))){
            set.add(new LinkedList<Integer>(track));
            res.add(new LinkedList<Integer>(track));
            }
            return;
        }
        for(int i=start;i<candidates.length;i++)
        {
            if(candidates[i] > target)
                break;
            
            track.add(candidates[i]);
            trackback(candidates,i+1,target-candidates[i],track);
            track.removeLast();
        }
    }
}

class Solution {
    List<List<Integer>> res = new LinkedList<>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        LinkedList<Integer> track = new LinkedList<>();
        Arrays.sort(candidates);
        trackback(candidates,0,target,track);
        return res;
    }
    private void trackback(int[] candidates , int start ,int target ,LinkedList<Integer> track){
        if(target == 0)
        {
            res.add(new LinkedList<Integer>(track));
            return;
        }
        for(int i=start;i<candidates.length;i++)
        {
            if(candidates[i] > target)
                break;

            if(i>start && candidates[i] == candidates[i-1])
                continue;
            
            track.add(candidates[i]);
            trackback(candidates,i+1,target-candidates[i],track);
            track.removeLast();
        }
    }
}