题目:
解答:
和Combination Sum类似,递归搜索的时候从下一个数开始搜索就可以,注意先要生成最后结果,再排序,删除重复元素。
class Solution {
public:
vector<vector<int> > combinationSum2(vector<int> &candidates, int target) {
vector<int> temp;
vector<vector<int> > res;
vector<vector<int> > res1;
if (candidates.size() == 0)
return res;
search(target, res, temp, 0, candidates);
//最终结果排序
for (vector<vector<int> >::iterator it = res.begin(); it != res.end(); it++)
{
sort(it->begin(), it->end());
//如果不重复,加入到新的结果容器
if(find(res1.begin(),res1.end(),*it) == res1.end())
res1.push_back(*it);
}
return res1;
}
private:
void search(int sum, vector<vector<int> > &res, vector<int> &temp, int pos, vector<int> &candidates)
{
if (sum == 0)
{
//不可以在这里排序,会破坏数组的加入顺序
if(find(res.begin(), res.end(), temp) == res.end())
res.push_back(temp);
return;
}
if (sum < 0)
{
return;
}
for (int i = pos; i < candidates.size(); i++)
{
sum -= candidates[i];
temp.push_back(candidates[i]);
search(sum, res, temp, i+1, candidates);
sum += candidates[i];
temp.pop_back();
}
}
};