update

Author: tangweikun

CATEGORY.md

@@ -76,10 +76,47 @@ https://garciparedes.me/#headers
   - [ ] 264
   - [ ] 279
   - [ ] 300
-  - [ ] 303
   - [ ] 309
   - [ ] 322
   - [ ] 338
   - [ ] 343
   - [ ] 357
   - [ ] 376
+
+- 数组
+
+  - [x] 4
+  - [x] 11
+  - [ ] 15
+  - [x] 16
+  - [ ] 18
+  - [x] 26
+  - [x] 27
+  - [x] 34
+  - [x] 35
+  - [ ] 39
+  - [ ] 40
+  - [ ] 42
+  - [ ] 45
+  - [ ] 48
+  - [ ] 53
+  - [ ] 55
+  - [ ] 56
+  - [ ] 59
+  - [ ] 62
+  - [ ] 64
+  - [ ] 66
+  - [ ] 73
+  - [ ] 75
+  - [ ] 78
+  - [ ] 80
+  - [ ] 88
+  - [ ] 90
+  - [ ] 118
+  - [ ] 119
+  - [ ] 120
+  - [ ] 121
+  - [ ] 122
+  - [ ] 152
+  - [ ] 153
+  - [ ] 154

src/39-combination-sum/index.js

@@ -1,23 +1,24 @@
-// HELP:
-// backtracking
-
-export const combinationSum = (candidates, target) => {
-  let res = [];
-  backtracking(res, [], candidates, target, 0);
+/**
+ * @param {number[]} candidates
+ * @param {number} target
+ * @return {number[][]}
+ */
+var combinationSum = function (candidates, target) {
+  const res = [];
+  dfs(target, [], 0);
   return res;
-};
 
-function backtracking(res, temp, candidates, target, start) {
-  if (target === 0) res.push(temp.slice());
-  if (target > 0) {
-    for (let i = start; i < candidates.length; i++) {
-      backtracking(
-        res,
-        [...temp, candidates[i]],
-        candidates,
-        target - candidates[i],
-        i,
-      );
+  function dfs(target, combine, index) {
+    if (index === candidates.length) {
+      return;
+    }
+    if (target === 0) {
+      res.push(combine);
+      return;
+    }
+    dfs(target, combine, index + 1);
+    if (target - candidates[index] >= 0) {
+      dfs(target - candidates[index], [...combine, candidates[index]], index);
     }
   }
-}
+};

src/4-median-of-two-sorted-arrays/20210603.js

@@ -0,0 +1,38 @@
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number}
+ */
+var findMedianSortedArrays = function (nums1, nums2) {
+  const len = nums1.length + nums2.length;
+  if (len === 1) {
+    return ~~nums1[0] + ~~nums2[0];
+  }
+  const start = Math.floor(len / 2);
+  let count = 0;
+  const res = [];
+
+  while (nums1.length > 0 || nums2.length > 0) {
+    let temp;
+    if (nums1.length > 0 && nums2.length > 0) {
+      if (nums1[0] < nums2[0]) {
+        temp = nums1.shift();
+      } else {
+        temp = nums2.shift();
+      }
+    } else {
+      temp = nums1.shift();
+      temp = temp !== undefined ? temp : nums2.shift();
+    }
+
+    if (count === start - 1 || count === start) {
+      res.push(temp);
+    }
+
+    if (res.length === 2) {
+      return len % 2 === 1 ? res[1] : (res[0] + res[1]) / 2;
+    }
+
+    count++;
+  }
+};