Combination Sum II 组合数之和（包含有重复的元素）

class Solution {
public:


void DFS(int start,int cursum,int target,vector<int> &candidates,vector<int> &path,vector<vector<int>>&ret)
{
    if(cursum==target)
    {
        ret.push_back(path);
        return;
    }
    int previous=-1;
    for(int i=start;i<candidates.size();i++)
    {   
       if(previous==candidates[i])
        continue;
        cursum+=candidates[i];
        if(cursum>target)
        return;
        previous=candidates[i];
        path.push_back(candidates[i]);
        DFS(i+1,cursum,target,candidates,path,ret);
        path.pop_back();
        cursum-=candidates[i];
    }
}
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
    sort(num.begin(),num.end());
    vector<int> path;
    vector<vector<int>> ret;
    DFS(0,0,target,num,path,ret);
    return ret;
    }
};