Leetcode: 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] 

Similar to Combination Sum, but when encountering the same element in the given array, only use it when it's to be used with the other same elements. 

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