Leetcode no. 40

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<List<Integer>> list= new LinkedList<List<Integer>>();
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        if (candidates.length==0)  return list;
        List<Integer> prevlist= new LinkedList<Integer>();
        Arrays.sort(candidates);
        combination(candidates, prevlist, 0, 0, target);
        return list;
    }
    private void combination(int[] candi, List<Integer> prevArr, int start, int sum, int target){
        if (start>candi.length) return;
        if (sum== target){
            List<Integer> tmp= new LinkedList<Integer>();
            tmp.addAll(prevArr);
            list.add(tmp);
            return;
        }
        else if (sum > target) return;
        else{
            int prev=-1;
            for (int i = start; i < candi.length; i++) {
                if (candi[i] == prev) continue;
                if (candi[i] > target) break;
                List<Integer> tmp= new LinkedList<Integer>(prevArr);
                tmp.add(candi[i]);
                prev= candi[i];
                combination(candi, tmp, i+1, sum+candi[i], target);
            }
        }
    }
}