combination sum solution

Author: bhan

combination-sum/byol-han.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} candidates
+ * @param {number} target
+ * @return {number[][]}
+ */
+var combinationSum = function (candidates, target) {
+  const result = [];
+
+  function backtrack(remaining, combination, start) {
+    if (remaining === 0) {
+      result.push([...combination]);
+      return;
+    }
+    if (remaining < 0) return;
+
+    for (let i = start; i < candidates.length; i++) {
+      combination.push(candidates[i]);
+      backtrack(remaining - candidates[i], combination, i); // 같은 숫자 다시 사용 가능
+      combination.pop(); // backtrack
+    }
+  }
+
+  backtrack(target, [], 0);
+  return result;
+};