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] 

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    void helper(const vector<int> &num, const int length, int index, int target, vector<vector<int> > &results, vector<int> result) {
        if (target == 0) {
            results.push_back(result);
            return;
        }
        if (target < 0) return;
        for (int i = index; i < length; ++i) {
            result.push_back(num[i]);
            helper(num, length, i+1, target-num[i], results, result);
            result.pop_back();
            if (target-num[i] < 0) break;
            while (i+1 < length && num[i] == num[i+1]) ++i;
        }
    }
    
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        const int length = num.size();
        sort(num.begin(), num.end());
        vector<vector<int> > results;
        vector<int> result;
        helper(num, length, 0, target, results, result);
        return results;
    }
};</span>