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.
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>& candidates, int target) {
        vector<vector<int>> solve;//结果
        vector<int> combination;//临时
        sort(candidates.begin(), candidates.end());
        combinations(candidates, target, combination, solve, 0);
        return solve;
    }
private:
    void combinations(vector<int>& candidates, int target, vector<int>& combination, vector<vector<int>>& solve, int begin){
        if(!target)
        {
            solve.push_back(combination);
            return;
        }
        for(int i = begin;i < candidates.size(); i++)
        {
            if(i && candidates[i]==candidates[i-1] && i>begin)
                continue;
            if(target >= candidates[i])
            {
                combination.push_back(candidates[i]);
                combinations(candidates, target-candidates[i], combination, solve, i+1);
                combination.pop_back();
            }
            else
                return;
        }
    }
};