class Solution {
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<vector<int> > res;
vector<int> set;
sort(candidates.begin(),candidates.end());
helper(candidates,0,target,set,res);
return res;
}
void helper(vector<int>& candidates,int idx,int target,vector<int>& set,vector<vector<int> >& res){
for(int i=idx;i<candidates.size()&&candidates[i]<=target;i++)
{
set.push_back(candidates[i]);
if(candidates[i]==target)
{
res.push_back(set);
set.pop_back();
break;
}
else
{
helper(candidates,i,target-candidates[i],set,res);
set.pop_back();
}
}
}
};
leetcode 39: Combination Sum
最新推荐文章于 2020-02-24 23:26:48 发布