Javascript中的组合求和

function combinationSum(candidates, target) {
  const result = [];
  
  function backtrack(combination, start, sum) {
    if (sum === target) {
      result.push([...combination]);
      return;
    }
    
    if (sum > target) {
      return;
    }
    
    for (let i = start; i < candidates.length; i++) {
      combination.push(candidates[i]);
      backtrack(combination, i, sum + candidates[i]);
      combination.pop();
    }
  }
  
  backtrack([], 0, 0);
  
  return result;
}

const candidates = [2, 3, 6, 7];
const target = 7;
const combinations = combinationSum(candidates, target);
console.log(combinations);