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.

combinationSum2.java

/*
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 ArrayList<ArrayList<Integer>> combinationSum2(int[] num, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        ArrayList<ArrayList<Integer>> result=new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> list=new ArrayList<Integer>();
        Arrays.sort(num);
        getCombination(num,0,target,list,result);
        return result;
    }
    public void getCombination(int[] array, int start, int target, ArrayList<Integer>curList, ArrayList<ArrayList<Integer>> curResult) {
        if((start==array.length)|| (target<0))return;
        for(int i=start;i<array.length;i++) {
            if(i>start && (array[i]==array[i-1])) continue;
            curList.add(array[i]);
            if(target-array[i]==0) {
                curResult.add(new ArrayList<Integer>(curList));
            }
            if(i<array.length-1) getCombination(array,i+1,target-array[i],curList,curResult);
            curList.remove(curList.size()-1);
        }
        return;
    }
}