40. Combination Sum II

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]
]

本题与 39. Combination Sum类似，本题求解时，候选数组中同一个元素不能多次选择，程序如下：

class Solution {
    public void dfs(int[] candidates, List<List<Integer>> result, 
                    List<Integer> tmp, int start, int target){
        if (target == 0){
            result.add(new ArrayList<>(tmp));
            return;
        }
        if (start == candidates.length||target < 0){
            return;
        }
        for (int i = start; i < candidates.length; ++ i){
            if (i != start&&candidates[i] == candidates[i-1]){
                continue;
            }
            tmp.add(candidates[i]);
            dfs(candidates, result, tmp, i + 1, target - candidates[i]);
            tmp.remove(tmp.size() - 1);
        }
    }
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        List<List<Integer>> result = new ArrayList<>();
        List<Integer> tmp = new ArrayList<>();
        Arrays.sort(candidates);
        dfs(candidates, result, tmp, 0, target);
        return result;
    }
}