(java)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] 

思路:本题就是一个普通的回溯问题

下面模仿一下过程

10比8大，下一个开始

1 ---->2------->7比8大，回溯1---》2---》6比8大回溯1---》2----》1----》比8大，回溯 1---》2----》5找到一个

重复上面的过程就行了

代码如下(已通过leetcode)

public class Solution {
   public List<List<Integer>> combinationSum2(int[] candidates, int target) {
    List<List<Integer>> lists=new ArrayList<List<Integer>>();
    List<Integer> list=new ArrayList<Integer>();
    Arrays.sort(candidates);
    genaratelists2(candidates,0,candidates.length-1,lists,list,target);
    Set<List<Integer>> sets=new HashSet<List<Integer>>();
   
    int length=lists.size();
    int i=0;
    while(i<length) {
    sets.add(lists.get(0));
    lists.remove(0);
    i++;
    }
   
    Iterator<List<Integer>> it=sets.iterator();
    while(it.hasNext()){
    lists.add(it.next());
    }
    return lists;
   }


private void genaratelists2(int[] candidates, int start, int end, List<List<Integer>> lists, List<Integer> list,
int target) {
// TODO Auto-generated method stub
if(target<0) return;
if(target==0) {
lists.add(new ArrayList<Integer>(list));
return;
}
for(int i=start;i<=end;i++) {
list.add(candidates[i]);
genaratelists2(candidates, i+1, end, lists, list, target-candidates[i]);
list.remove(list.size()-1);
}
}
}