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

这道题和39题很像，不同的是，数字不能重复使用，但是candidate里可以有重复数字，即[1, 1, 6]这样的组合是对的，但是[1,2,5]和第二个1的[1,2,5]只能计算一次

避免重复在for循环里判断如果有重复的就continue

刚开始用的是

if (i != candidates.size() && candidates[i] == candidates[i - 1]) continue;

结果发现，这样子把[1,1,6]这种组合的重复也去掉了，要用：

if (i != start && candidates[i - 1] == candidates[i]) continue;

这样当i为组合开头的时候不查重复，就可以把[1,1,6]这种组合也包含进去。

代码如下：

class Solution {
public:
    void dfs(vector<int> candidates, int start, int curtarget, vector<int>& curcom, vector<vector<int>>& result) {
        if (curtarget == 0) {
            result.push_back(curcom);
            return ;
        }
        if (curtarget < 0) return ;
        
        for (int i = start; i < candidates.size(); i++) {
            if (i != start && candidates[i - 1] == candidates[i]) continue;
            curcom.push_back(candidates[i]);
            dfs(candidates, i+1, curtarget-candidates[i], curcom, result);
            curcom.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<vector<int>> result;
        vector<int> curcom;
        dfs(candidates, 0, target, curcom, result);
        return result;
    }
};