class Solution {
public:
vector<int> path;
vector<vector<int>> result;
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
traverse(candidates,target,0);
return result;
}
void traverse(vector<int>& candidates, int target, int start_index){
if(target==0){
result.push_back(path);
return;
}
if(target<0) return;
for(int i=start_index;i<candidates.size();i++){
path.push_back(candidates[i]);
traverse(candidates,target-candidates[i],i);
path.pop_back();
}
}
};
刷题记录第八十八天-组合总和-利用start_index去重
最新推荐文章于 2024-07-22 09:12:27 发布