LeetCode 39 组合总和

组合总和

class Solution {
public:
vector<vector> result;
vector<vector> combinationSum(vector& candidates, int target) {
//使用回溯法的使用
vector temp;
int sum=0;
int begin=0;
DFS(candidates,target,temp,sum,begin);
return result;
}
void DFS(vector& nums,int target,vector& temp,int sum,int begin)
{
if(target==sum)
{
result.push_back(temp);
return;
}
if(target<sum)
return;
for(int i=begin;i<nums.size();++i)
{
temp.push_back(nums[i]);
DFS(nums,target,temp,sum+nums[i],i);
temp.pop_back();
}
}
};