Combination Sum II

Problem：

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] 

    此题的思路和Combination Sum的是一致的，只是每个元素只能添加一次。遇到重复元素时不能逐一递归，要一次性处理，否则会有重复的组合。

Solution:

public class Solution {
    public List<List<Integer>> combinationSum2(int[] num, int target) {
        if(num==null||num.length==0)
            return new ArrayList<>();
        Arrays.sort(num);
        return subCombination(num, num.length-1, target);
    }
    
    private List<List<Integer>> subCombination(int[] num,int p,int target)
    {
         if(target<num[0]||target>num[p]*(p+1))
             return new ArrayList<>();
         int q = p;
         while(q>=0&&num[q]==num[p])q--;
         List<List<Integer>> res = new ArrayList<>();
         for(int i=0;i<=p-q;i++)
         {
             int remain = target - num[p]*i;
             if(remain==0)
             {
                 List<Integer> arr = new ArrayList<>();
                 for(int j=0;j<i;j++)
                     arr.add(num[p]);
                 res.add(arr);
             }
             else if(remain>0&&q>=0)
            {
                 List<List<Integer>> tmp = subCombination(num, q, remain);
                 for(List<Integer> list:tmp)
                     for(int j=0;j<i;j++)
                         list.add(num[p]);
                 res.addAll(tmp);
             }
         }
         return res;
    }
}