combinationSum&&combinationSumII

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
using namespace std;
void dfs(vector<int>&nums,int gap,int start,vector<int>&intermediate,vector<vector<int>>&result)
{
if(gap==0)
{
result.push_back(intermediate);
return;
}
for(size_t i=start;i<nums.size();++i)
{
if(gap<nums[i])
return;
intermediate.push_back(nums[i]);
dfs(nums,gap-nums[i],i,intermediate,result);
intermediate.pop_back();
}
}
void dfs1(vector<int>&nums,int gap,int start,vector<int>&intermediate,vector<vector<int>>&result)
{
if(gap==0)
{
result.push_back(intermediate);
return;
}
//int previous=-1;
for(size_t i=start;i<=nums.size();++i)
{
// if(previous==nums[i])
// continue;
if(gap<nums[i])
return;
//previous=nums[i];
intermediate.push_back(nums[i]);
dfs1(nums,gap-nums[i],i+1,intermediate,result);
intermediate.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>&nums,int target)
{
sort(nums.begin(),nums.end());
vector<int> intermediate;
vector<vector<int>>result;
dfs1(nums,target,0,intermediate,result);
return result;
}


int main()
{
int a[]={10,1,2,7,6,1,5};
vector<int>nums(a,a+sizeof(a)/sizeof(int));
int target=8;
vector<vector<int>>result=combinationSum(nums,target);
set<vector<int>>b;
for(vector<int>&im:result)
{
b.insert(im);
}
vector<vector<int>>re;
for(set<vector<int>>::iterator i=b.begin();i!=b.end();++i)
re.push_back(*i);
for(auto im:re)
{
for(auto i:im)
cout<<i<<" ";
cout<<endl;
}
return 0;
}