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] ]
这道题目和Combination Sum那道相比不同点是
1. 本题中给定的candidates数组中可能包含重复的数字;
2. 本题中每个candidate只能选一次(重复出现的相同的数字可以都被选)
依然采用回溯的思想,在大循环中多一步判断以保证当前开头的数字和之前的组合都不同。先对数组进行排序,这样当出现 candidates[i] > target 的情况就可以直接跳过 i 以后的所有可能。for 循环中的 while 循环控制跳过重复的打头数字,这样就能保证结果中不包含重复的组合。例如,在没有while循环这段代码的时候,对于输入数组[1,1,1,5],sum=6,输出结果为三个1,5,这是不对的。
代码如下:
void getCombination(vector<int>& candidates, vector<vector<int>>& ans, vector<int> curr, int start, int target) {
if (target == 0) {
ans.push_back(curr);
return;
}
for (int i = start; i < candidates.size(); i++) {
if(candidates[i] > target) {
return;
}
curr.push_back(candidates[i]);
getCombination(candidates, ans, curr, i + 1, target - candidates[i]);
curr.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>> ans;
vector<int> curr;
sort(candidates.begin(), candidates.end());
getCombination(candidates, ans, curr, 0, target);
return ans;
}