Problem Description:

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:

    void dfs(vector<int> &candidates,int target,int start,vector<vector<int> > &results,vector<int> &subset)
    {
        if(target==0)
        {
            results.push_back(subset);
            return;
        }
        if(target<0||start>=candidates.size()) 
            return;
        for(size_t i=start;i!=candidates.size();++i)
        {
            if(i>start && candidates[i]==candidates[i-1]) continue;
            subset.push_back(candidates[i]);
            dfs(candidates,target-candidates[i],i+1,results,subset);
            subset.pop_back();
        }
        
    }

    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        sort(num.begin(),num.end());
        vector<vector<int> > results;
        vector<int> subset;
        dfs(num,target,0,results,subset);
        return results;
    }
};