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

思路：回溯法

public class Solution {
	public List<List<Integer>> combinationSum2(int[] candidates, int target) {
		List<List<Integer>> result = new LinkedList<List<Integer>>();
		Arrays.sort(candidates);
		LinkedList<Integer> intermediate=new LinkedList<Integer>();
		dfs(candidates,target,0,intermediate,result);
		return result;
	}

	private void dfs(int[] candidates,int gap,int level,List<Integer> intermediate,List<List<Integer>> result){
		if(gap==0){	
			result.add(new LinkedList<Integer>(intermediate));
			return;
		}
		int previos=-1;
		for(int i=level;i<candidates.length;i++){
			// 如果上一轮循环没有选candidates[i]，则本次循环就不能再选candidates[i]，
			// 确保candidates[i] 最多只用一次
			if(previos==candidates[i]) continue;
			if(gap<candidates[i]) return;
			previos=candidates[i];
			intermediate.add(candidates[i]);
			dfs(candidates,gap-candidates[i],i+1,intermediate,result);
			intermediate.remove(intermediate.size()-1);
		}
	}
}