class Solution {
public:
vector<vector<int> >ans;
vector<int>path;
void backtracking(int target,int sum,int star,vector<int> candidates){
if(sum==target){
ans.push_back(path);
return;
}
if(sum>target){
return;
}
for(int i=star;i<=candidates.size()-1;i++){
sum+=candidates[i];
path.push_back(candidates[i]);
backtracking(target,sum,i,candidates);
path.pop_back();
sum-=candidates[i];
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
backtracking(target,0,0,candidates);
return ans;
}
};
39. 组合总和
最新推荐文章于 2024-08-09 20:36:57 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)