40. Combination Sum II

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

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

Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:
[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

Example 2: 

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:
[
  [1,2,2],
  [5]
]

记录一下去重的核心思想：(树形图内)同一层内数字不能重复，不同层间数字可以重复。

Answer:

class Solution {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
    	Arrays.sort(candidates);
    	List<List<Integer>> ans = new ArrayList<>();
    	List<Integer> temp = new ArrayList<>();
    	dfs(0,  0,  candidates, target, ans, temp);
    	return ans;
    }
    
    public void dfs(int index, int sum, int[] a, int target, List<List<Integer>> ans, List<Integer> temp) {
    	if(sum == target) {
    		ans.add(new ArrayList<>(temp));
    		return;
    	}  
    	if(index == a.length) {
    		return;
    	}
    	if(sum > target) {
    		return;
    	}
    
    	temp.add(a[index]);
    	dfs(index+1, sum+a[index], a, target, ans, temp);
    	temp.remove(temp.size()-1);
    	int j = index+1;
    	for(;j<a.length && a[j]==a[j-1];j++);//去重
    	dfs(j, sum, a, target, ans, temp);
    }
}