Combination Sum II Java

 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] 

Idea: 99% same as Combination Sum, beside, the duplication is not

     allow, all we need to do is to increment last selection by i+1 instead i
     before in Combination Sum & skip the recursion step when i>last instead of  i>0
    Combinations Sum II:
    num: set of numbers
    target: when target==0, we find combination satisfied requirement
            that target minus elements from set of "candidates"
    last: last selection, start from 0 & increment as i+1 each time
    curr: a list containing current combination

    res: result of list contain all combinations

public class Solution {
    public ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
        ArrayList<ArrayList<Integer>> res=new ArrayList<ArrayList<Integer>>();
        if(num.length==0 || target==0) return res;
        Arrays.sort(num);
        helper(num,target,0,res,new ArrayList<Integer>());
        return res;
    }
    private void helper(int[] num, int target,int last,ArrayList<ArrayList<Integer>> res,
                               ArrayList<Integer> curr){
            if(target<0) return;;
            if(target==0){
                res.add(new ArrayList<Integer>(curr));
                return;
            }
        for(int i=last;i<num.length;i++){
            if(i>last && num[i]==num[i-1]){
                continue;
            }
            curr.add(num[i]);
            helper(num,target-num[i],i+1,res,curr);
            curr.remove(curr.size()-1);
        }
    }
}