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) {        sort(num.begin(), num.end());        vector<vector<int> > ret;        vector<int> cur;        Helper(ret, cur, num, target, 0);        return ret;    }    void Helper(vector<vector<int> > &ret, vector<int> cur, vector<int> &num, int target, int position)    {        if(target == 0)            ret.push_back(cur);        else        {            for(int i = position; i < num.size() && num[i] <= target; i ++)            {                if(i != position && num[i] == num[i-1])                    continue;                cur.push_back(num[i]);                Helper(ret, cur, num, target-num[i], i+1);                cur.pop_back();            }        }    }};