Merge pull request #83 from AlgorithmIsMyLife/jiho-24

[Daily 24] Jiho 2Q

Author: jihostudy

Jiho/Day24/Leetcode_39. Combination Sum.js

@@ -0,0 +1,30 @@
+var combinationSum = function (candidates, target) {
+  const len = candidates.length;
+  let answer = [];
+  let accumulate = [];
+  function backtracking(remain, arr, index) {
+    if (remain === 0) {
+      answer.push(arr);
+      return;
+    }
+    if (index < 0) {
+      return;
+    }
+    const val = candidates[index];
+    const q = Math.floor(remain / val); // q번 만큼 backtracking 해야함
+
+    for (let i = q; i >= 0; i--) {
+      const new_arr = [...arr];
+      for (let j = 0; j < i; j++) {
+        new_arr.push(val);
+      }
+
+      backtracking(remain - i * val, new_arr, index - 1);
+    }
+  }
+
+  backtracking(target, accumulate, len - 1);
+  return answer;
+};
+
+console.log(combinationSum([2], 1));

Jiho/Day24/Leetcode_78. Subsets.js

@@ -0,0 +1,20 @@
+var subsets = function (nums) {
+  let accumulate = [];
+  let answer = [];
+  function backtracking(arr, index) {
+    // 마지막
+    if (index === nums.length) {
+      answer.push(arr);
+      return;
+    }
+    const cpy = [...arr];
+    backtracking(cpy, index + 1);
+    arr.push(nums[index]);
+    backtracking(arr, index + 1);
+  }
+  backtracking(accumulate, 0);
+
+  return answer;
+};
+
+console.log(subsets([1, 2, 3]));