Leetcode 40. Combination Sum II

原题：

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inC 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 target8,
A solution set is:

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

解决方法：

跟39. Combination Sum类似，注意两个小细节：

- 数字只能用一次，所有下一次的数组序号是i+1;

- 原始数组中有重复数字，所有注意跳过所有重复数字。

代码：

void backtrace(vector<vector<int>>& res, vector<int>& items, vector<int>& candidates, int index, int target) {
		if (target == 0) {
			res.push_back(items);
			return;
		}

		for (int i = index; i < candidates.size() && candidates[i] <= target; i++) {
			items.push_back(candidates[i]);
			backtrace(res,  items, candidates, i + 1,target - candidates[i]);
			items.pop_back();
            
            while ( (i+1<candidates.size()) && candidates[i+1] == candidates[i])
                ++i;
		}
	}
    
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> items;
        sort(candidates.begin(), candidates.end());
        backtrace(res, items, candidates, 0, target);
        return res;
    }