[leedcode 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.

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 {
    List<Integer> seq;
    List<List<Integer>> res;
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        //    Combination Sum    ，              。         i+1（2）
        //       ，      add ，              （1）。level            
        Arrays.sort(candidates);
        seq=new ArrayList<Integer>();
        res=new ArrayList<List<Integer>>();
        find(candidates,target,0,0);

        return res;
    }
    public void find(int[] candidates,int target,int sum,int level){
        if(sum==target){//1
            if(!res.contains(seq))
            res.add(new ArrayList<Integer>(seq));
            return;
        }
        if(sum>target){
            return;
        }
        for(int i=level;i<candidates.length;i++){
            seq.add(candidates[i]);
            sum+=candidates[i];
            find(candidates,target,sum,i+1);//2
            seq.remove(seq.size()-1);
            sum-=candidates[i];
        }
        
        
        
    }
}