40 . Combination Sum II
Difficulty: Medium
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] ]
解题思路
递归回溯思想在这道题目中有着很好的发挥。在同一层递归树中,如果某元素已经处理并进入下一层递归,那么与该元素相同的值就应该跳过。否则将出现重复。
例如:1,1,2,3
如果第一个1已经处理并进入下一层递归1,2,3
那么第二个1就应该跳过,因为后续所有情况都已经被覆盖掉。
相同元素第一个进入下一层递归,而不是任意一个
例如:1,1,2,3
如果第一个1已经处理并进入下一层递归1,2,3,那么两个1是可以同时成为可行解的
而如果选择的是第二个1并进入下一层递归2,3,那么不会出现两个1的解了。
具体实现
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();
}
}
}
};