问题描述:
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.
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] ]问题分析:
对以这种求和问题,我们首先考虑将数组升序排序,按照顺序依次进行回溯求解,这里有个小细节注意一下,candidates数组有重复的元素,所以在求解的过程中要注意排除重复元素的影响。
过程详见代码:
class Solution {
public:
vector<vector<int> > combinationSum2(vector<int>& candidates, int target) {
sort(candidates.begin(),candidates.end());
vector<vector<int> > res;
set<vector<int> > sres;
vector<int> re;
int start = 0;
sumBS(sres,candidates,re,target,start);
res.assign(sres.begin(),sres.end());
return res;
}
void sumBS(set<vector<int> >& sres,vector<int>& candidates, vector<int>& re, int target,int start)
{
for(int i = start; i < candidates.size(); i++)
{
if(i > start && candidates[i] == candidates[i - 1]) continue; // 排除重复元素的影响
if(candidates[i] <= target)
{
re.push_back(candidates[i]);
if(candidates[i] == target)
{
sres.insert(re);
}
else sumBS(sres,candidates,re,target - candidates[i],i + 1);
re.pop_back();
}
else break;
}
}
};