var combinationSum = function(candidates, target) {
var answers = [];
var answer = [];
var backtrack = function(sum, start){
if(sum > target){
return;
}
if(sum == target){
//answer.push(answer)传递的是指针,所以深拷贝answer
answers.push([...answer]);
return;
}
for(var i = start; i < candidates.length; ++i){
sum += candidates[i];
answer.push(candidates[i]);
backtrack(sum , i, answer);
sum -= candidates[i];
answer.pop();
}
}
backtrack(0, 0);
return answers;
};
JS力扣刷题39. 组合总和
最新推荐文章于 2023-01-04 20:35:43 发布