[leetcode 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] 

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        vector<int> cur;
        vector<vector<int> > res;
        sort(num.begin(), num.end());
        dfs(num, 0, target, cur, res);
        return res;
        
    }
    void dfs(vector<int> &candidate, int start, int gap, vector<int> &cur, vector<vector<int> > &res) {
        if (gap == 0) {
            res.push_back(cur);
            return ;
        }
        int prev = -1;
        for (int i = start; i < candidate.size(); i++) {
            if (gap < candidate[i]) {
                return ;
            }
            if (prev == candidate[i]) {
                continue;
            }
            prev = candidate[i];
            cur.push_back(candidate[i]);
            dfs(candidate, i+1, gap-candidate[i], cur, res);
            cur.pop_back();
        }
        
    }
};