Combination Sum II

不同于Combination Sum I，这个是collection，是包含重复的元素。我们需要做一个判断，略过重复项。

public class Solution {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        List<List<Integer>> result = new LinkedList<>();
        if (candidates == null || candidates.length == 0) {
            return result;
        }
        List<Integer> list = new LinkedList<>();
        Arrays.sort(candidates);
        combinationSum2(result, list, candidates, target, 0);
        return result;
    }
    
    private void combinationSum2(List<List<Integer>> result, List<Integer> list, int[] candidates, int target, int pos) {
        if (target == 0) {
            ///
            //if (!result.contains(list))
            //
            result.add(new LinkedList<>(list));
            return;
        } else if (target < 0) {
            return;
        }
        for (int i = pos; i < candidates.length; i++) {
            if (i > pos && candidates[i] == candidates[i - 1]) {
                continue;
            }
            list.add(candidates[i]);
            combinationSum2(result, list, candidates, target - candidates[i], i + 1);
            list.remove(list.size() - 1);
        }
    }
}

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C 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.

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8, 
A solution set is: 

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]