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.
• Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
• 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] 

这道题和combination sum的区别在于不可以出现重复的，所以要设一个visited数组，集合中出现过的都不再递归调用。除此之外，还要判断st中是否已经存在这个集合，相同的集合不加入st，因为集合中有相同的元素，所以遍历后肯定存在一模一样的集合。

Source

public class Solution {
    public List<List<Integer>> combinationSum2(int[] num, int target) {
        List<List<Integer>> st = new ArrayList<List<Integer>>();
        List<Integer> a = new ArrayList<Integer>();
    	if(num.length == 0) return st;
    	int sum = 0;
    	int start = 0;
    	
    	boolean[] visited = new boolean[num.length];
    	Arrays.sort(num);  //这道题的测试数据有乱序的
    	dfs(visited, start, sum, num, target, st, a);
    	return st;
    }
    public void dfs(boolean[] visited, int start, int sum, int[] candidates, int target, List<List<Integer>> st, List<Integer> a){
    	if(sum > target) return;
    	if(sum == target){
    		if(!st.contains(a))
    			st.add(new ArrayList<Integer>(a));
    		return;
    	}
    	
    	for(int i = start; i < candidates.length; i++){
    		if(!visited[i]){
    			visited[i] = true;
    			a.add(candidates[i]);
    			dfs(visited, i, sum + candidates[i], candidates, target, st, a); //注意sum是要随着dfs变化的
    			a.remove(a.size() - 1);
    			visited[i] = false;
    		}
    	}
    }
}

Test

    public static void main(String[] args){
    	int[] num = {10, 1, 2, 7, 6, 1, 5};
    	int target = 8;
    	System.out.println(new Solution().combinationSum2(num, target));
    
    }