和昨天差不多
一种暴力去重 昨天方法对结果set
一种中间去重
暴力去重是直接算出结果后用set insert
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>>res;
sort(candidates.begin(),candidates.end());
if(candidates.size() == 0 || candidates[0] > target)
{
return res;
}
vector<int>tmp;
dfs(candidates,target,0,0,tmp,res);
set<vector<int>> s;
for(auto c : res)
{
s.insert(c);
}
vector<vector<int>>ans;
for(auto c : s)
{
ans.push_back(c);
}
return ans;
}
void dfs(vector<int>& candidates, int target, int start, int sum, vector<int>& tmp, vector<vector<int>>& res)
{
if(sum == target)
{
res.push_back(tmp);
return;
}
if(sum > target)
{
sum -= tmp[tmp.size()-1];
//tmp.pop_back();
return;
}
for(int i = start; i < candidates.size(); i++)
{
if(i > start && candidates[i] == candidates[i-1])
{
// continue;
}
tmp.push_back(candidates[i]);
dfs(candidates,target,i+1,sum + candidates[i],tmp,res);
tmp.pop_back();
}
}
};
class Solution {
public:
vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
vector<vector<int>>res;
sort(candidates.begin(),candidates.end());
if(candidates.size() == 0 || candidates[0] > target)
{
return res;
}
vector<int>tmp;
dfs(candidates,target,0,0,tmp,res);
// set<vector<int>> s;
// for(auto c : res)
// {
// s.insert(c);
// }
// vector<vector<int>>ans;
// for(auto c : s)
// {
// ans.push_back(c);
// }
return res;
}
void dfs(vector<int>& candidates, int target, int start, int sum, vector<int>& tmp, vector<vector<int>>& res)
{
if(sum == target)
{
res.push_back(tmp);
return;
}
if(sum > target)
{
sum -= tmp[tmp.size()-1];
//tmp.pop_back();
return;
}
for(int i = start; i < candidates.size(); i++)
{
if(i > start && candidates[i] == candidates[i-1])
{
continue;
}
tmp.push_back(candidates[i]);
dfs(candidates,target,i+1,sum + candidates[i],tmp,res);
tmp.pop_back();
}
}
};