40. 组合总和 II

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

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

注意：解集不能包含重复的组合。 

示例 1:

输入: candidates = [10,1,2,7,6,1,5], target = 8,
输出:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]

示例 2:

输入: candidates = [2,5,2,1,2], target = 5,
输出:
[
[1,2,2],
[5]
]

提示:

• 1 <= candidates.length <= 100
• 1 <= candidates[i] <= 50
• 1 <= target <= 30

class Solution {
      List<List<Integer>> res = new ArrayList<>();

    public  List<List<Integer>> combinationSum2(int[] candidates, int target) {
        if (candidates == null || candidates.length == 0) {
            return res;
        }
        LinkedList<Integer> track = new LinkedList<>();
        Arrays.sort(candidates);
        trackBrack(candidates, target, 0, track);
        return res;
    }

    public  void trackBrack(int[] candidates, int target, int index, LinkedList<Integer> track) {
        if (target < 0) {
            return;
        }
        if (target == 0) {
            ArrayList<Integer> list = new ArrayList<>(track);
            Collections.sort(list);
            if (!res.contains(list)) {
                res.add(list);
            }

            return;
        }
        for (int i = index; i < candidates.length; i++) {
            if (i > index && candidates[i] == candidates[i - 1]) {
                continue;
            }
            track.add(candidates[i]);
            trackBrack(candidates, target - candidates[i], i + 1, track);
            track.removeLast();
        }
    }
}