如何建视频网站,软文代写是什么,常德建设网站多少钱,东莞推广网站排名原题链接#xff1a;39.组合总和
思路#xff1a; 依旧是遍历整棵树#xff0c;此时终止条件变为总和sum大于给定的target值 或者等于target 就进行回溯
全代码#xff1a;
class Solution {
public:vectorvectorint result;vectorint path;voi…原题链接39.组合总和
思路 依旧是遍历整棵树此时终止条件变为总和sum大于给定的target值 或者等于target 就进行回溯
全代码
class Solution {
public:vectorvectorint result;vectorint path;void backtracking(vectorint candidates,int target, int sum, int startIndex){if(sum target) return ; //如果综合大于目标数则进行回溯if(sum target){//如果等于目标数则将组合存储进容器中并进行回溯result.push_back(path);return;}for(int i startIndex; i candidates.size(); i){sum candidates[i]; //经过一个结点则值相加path.push_back(candidates[i]);//将值pushback进容器内backtracking(candidates,target,sum,i);//递归遍历sum - candidates[i]; //回溯path.pop_back();//回溯}}vectorvectorint combinationSum(vectorint candidates, int target) {result.clear();path.clear();backtracking(candidates,target,0,0);return result;}
};
