36 - 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] 

solution：此题基本去35 Combination Sum一样，不同的是在递归的时候是访问当前位的后一位，然后访问完之后要跳过相同数值。

另查到去重还有一个方法，就是对产生的结果集进行排序，然后用unique和erase方法来做。该方法链接如下：

http://blog.unieagle.net/2012/09/16/leetcode%E9%A2%98%E7%9B%AE%EF%BC%9Acombination-sum-ii/

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        vector< vector< int > >result;
        vector< int >res;
        
        if(target <= 0 || num.size() <=0)
            return result;
            
        sort( num.begin(), num.end() );
        int sum = 0;
        
        generateCom(num, res, result, 0, sum, target);
        
        return result;
    }
    
    void generateCom(vector<int> &num, vector< int >&res, vector< vector< int > >&result, int cur, int sum, int target)
    {
        if(sum > target)return;
        else if(sum == target)
        {
            result.push_back(res);
            return;
        }
        
        for(int i = cur; i < num.size(); i++)
        {
            sum += num[i];
            res.push_back(num[i]);
            generateCom(num, res, result, i+1, sum, target);
            sum -= num[i];
            res.pop_back();
            while(i < num.size()-1 && num[i] == num[i+1])
                i++;
        }
    }
    
};