update

Author: tangweikun

CATEGORY.md

@@ -1,210 +1,131 @@
-https://ojeveryday.com/
-
-https://labuladong.gitbook.io/algo/di-ling-zhang-bi-du-xi-lie/gitbook
-
-https://github.com/garciparedes
-
-https://garciparedes.me/#headers
-
-- Array
-
-  - [x] 4
-  - [x] 11
-  - [ ] 15
-  - [x] 16
-  - [ ] 18
-  - [x] 26
-  - [x] 27
-  - [x] 34
-  - [x] 35
-  - [ ] 39
-  - [ ] 40
-  - [x] 42
-  - [ ] 45
-  - [ ] 55
-  - [x] 56
-  - [x] 66
-  - [x] 73
-  - [ ] 78
-  - [x] 80
-  - [ ] 88
-  - [ ] 90
-
-- Backtracking
-
-  - [ ] 17
-  - [ ] 22
-  - [ ] 39
-  - [ ] 40
-  - [ ] 46
-  - [ ] 47
-  - [ ] 60
-  - [ ] 77
-  - [ ] 78
-  - [ ] 90
-  - [ ] 131
-  - [ ] 211
-  - [ ] 216
-  - [ ] 306
-  - [ ] 357
-  - [ ] 872
-
-- Breadth First Search
-
-  - [ ] 101
-  - [ ] 103
-  - [ ] 107
-  - [ ] 111
-  - [ ] 199
-  - [ ] 200
-  - [ ] 279
-  - [ ] 513
-  - [ ] 515
-  - [ ] 542
-  - [ ] 690
-  - [ ] 744
-  - [ ] 801
-  - [ ] 877
-  - [ ] 884
-
-- Depth First Search
-
-  - [x] 100
-  - [x] 101
-  - [x] 108
-  - [x] 110
-  - [ ] 111
-  - [x] 112
-  - [x] 113
-  - [x] 129
-  - [ ] 199
-  - [ ] 200
-  - [ ] 257
-  - [ ] 337
-  - [ ] 394
-  - [ ] 473
-  - [ ] 491
-  - [ ] 494
-  - [ ] 513
-  - [ ] 515
-  - [ ] 542
-
-- Dynamic Programming
-
-  - [ ] 5
-  - [x] 53
-  - [x] 62
-  - [x] 64
-  - [x] 70
-  - [ ] 91
-  - [x] 120
-  - [x] 121
-  - [ ] 152
-  - [x] 198
-  - [ ] 264
-  - [ ] 279
-  - [ ] 300
-  - [ ] 309
-  - [ ] 322
-  - [ ] 338
-  - [ ] 343
-  - [ ] 357
-  - [ ] 376
-
-- Greedy
-
-  - [ ] 45
-  - [ ] 55
-  - [ ] 122
-  - [ ] 134
-  - [ ] 376
-  - [ ] 392
-  - [ ] 402
-  - [ ] 406
-  - [ ] 435
-  - [ ] 198
-  - [ ] 264
-  - [ ] 279
-  - [ ] 300
-  - [ ] 309
-  - [ ] 322
-  - [ ] 338
-  - [ ] 343
-  - [ ] 357
-  - [ ] 376
-
-- Hash Table
-
-  - [ ] 3
-  - [ ] 18
-  - [ ] 36
-  - [ ] 49
-  - [ ] 76
-  - [ ] 136
-  - [ ] 202
-  - [ ] 204
-  - [ ] 217
-  - [ ] 219
-  - [ ] 347
-  - [ ] 349
-  - [ ] 350
-  - [ ] 387
-  - [ ] 389
-  - [ ] 447
-  - [ ] 454
-  - [ ] 525
-  - [ ] 594
-
-- Linked List
-
-  - [ ] 21
-  - [ ] 83
-  - [ ] 141
-  - [ ] 148
-  - [ ] 160
-  - [ ] 203
-  - [ ] 206
-  - [ ] 234
-  - [ ] 237
-  - [ ] 445
-  - [ ] 766
-  - [ ] 908
-
-- Tree
-
-  - [ ] 94
-  - [ ] 100
-  - [ ] 101
-  - [ ] 103
-  - [ ] 104
-  - [ ] 107
-  - [ ] 108
-  - [ ] 110
-  - [ ] 111
-  - [ ] 112
-  - [ ] 113
-  - [ ] 129
-  - [ ] 144
-  - [ ] 173
-  - [ ] 226
-  - [ ] 235
-  - [ ] 257
-  - [ ] 297
-  - [ ] 404
-
-- Two Pointers
-
-  - [ ] 3
-  - [ ] 16
-  - [ ] 26
-  - [ ] 27
-  - [ ] 80
-  - [ ] 141
-  - [ ] 167
-  - [ ] 209
-  - [ ] 234
-  - [ ] 283
-  - [ ] 287
-  - [ ] 344
-  - [ ] 349
-  - [ ] 350
+https://ojeveryday.com/
+
+https://labuladong.gitbook.io/algo/di-ling-zhang-bi-du-xi-lie/gitbook
+
+https://github.com/garciparedes
+
+https://garciparedes.me/#headers
+
+- Array +12
+
+  - [ ] 15
+  - [ ] 18
+  - [ ] 39
+  - [ ] 40
+  - [ ] 45
+  - [ ] 55
+  - [ ] 78
+  - [ ] 88
+  - [ ] 90
+
+- Backtracking
+
+  - [ ] 17
+  - [ ] 22
+  - [ ] 39
+  - [ ] 40
+  - [ ] 46
+  - [ ] 47
+  - [ ] 60
+  - [ ] 77
+  - [ ] 78
+  - [ ] 90
+  - [ ] 131
+  - [ ] 211
+  - [ ] 216
+  - [ ] 306
+  - [ ] 357
+  - [ ] 872
+
+- Breadth First Search +5
+
+  - [ ] 107
+  - [ ] 542
+  - [ ] 801
+  - [ ] 877
+
+- Depth First Search +8
+
+  - [ ] 111
+  - [ ] 199
+  - [ ] 337
+  - [ ] 491
+  - [ ] 494
+  - [ ] 513
+  - [ ] 515
+  - [ ] 542
+
+- Dynamic Programming +7
+
+  - [ ] 357
+  - [ ] 376
+  - [ ] 1143
+  - [ ] 5
+  - [ ] 91
+  - [ ] 152
+  - [ ] 264
+  - [ ] 279
+  - [ ] 300
+  - [ ] 309
+  - [ ] 322
+  - [ ] 343
+
+- Greedy
+
+  - [ ] 134
+  - [ ] 376
+  - [ ] 392
+  - [ ] 402
+  - [ ] 406
+  - [ ] 435
+  - [ ] 198
+  - [ ] 264
+  - [ ] 279
+  - [ ] 300
+  - [ ] 309
+  - [ ] 322
+  - [ ] 338
+  - [ ] 343
+  - [ ] 357
+  - [ ] 376
+
+  - [ ] 45
+  - [ ] 55
+  - [ ] 122
+
+- Hash Table +6
+
+  - [ ] 389
+  - [ ] 447
+  - [ ] 454
+  - [ ] 525
+  - [ ] 594
+  - [ ] 18
+
+- Linked List
+
+  - [ ] 83
+  - [ ] 141
+  - [ ] 148
+  - [ ] 160
+  - [ ] 203
+  - [ ] 206
+  - [ ] 234
+  - [ ] 237
+  - [ ] 445
+  - [ ] 766
+  - [ ] 908
+  - [ ] 21
+
+- Tree +4
+
+  - [ ] 103
+  - [ ] 107
+  - [ ] 226
+  - [ ] 235
+  - [ ] 404
+
+- Two Pointers +7
+
+  - [ ] 3
+  - [ ] 16

src/104-maximum-depth-of-binary-tree/index.js

@@ -1,5 +1,3 @@
-// HELP:
-
 export function maxDepth(treeNode) {
   if (!treeNode) return 0;
   return Math.max(maxDepth(treeNode.left), maxDepth(treeNode.right)) + 1;

src/1143-longest-common-subsequence/index.js

@@ -0,0 +1,24 @@
+/**
+ * @param {string} text1
+ * @param {string} text2
+ * @return {number}
+ */
+var longestCommonSubsequence = function (text1, text2) {
+  const m = text1.length;
+  const n = text2.length;
+  const dp = new Array(m + 1).fill(0).map(() => new Array(n + 1).fill(0));
+
+  for (let i = 1; i < m + 1; i++) {
+    const c1 = text1.charAt(i - 1);
+    for (let j = 1; j < n + 1; j++) {
+      const c2 = text2.charAt(j - 1);
+      if (c1 === c2) {
+        dp[i][j] = dp[i - 1][j - 1] + 1;
+      } else {
+        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+      }
+    }
+  }
+
+  return dp[m][n];
+};

src/122-best-time-to-buy-and-sell-stock-ii/index.js

@@ -1,12 +1,12 @@
-// Time Complexity O(n)
-// Space Complexity O(1)
-
-export function maxProfit2(prices) {
-  let maxProfit = 0;
-  for (let i = 1; i < prices.length; i++) {
-    const different = prices[i] - prices[i - 1];
-    if (different > 0) maxProfit += different;
-  }
-
-  return maxProfit;
-}
+// Time Complexity O(n)
+// Space Complexity O(1)
+
+export function maxProfit2(prices) {
+  let maxProfit = 0;
+  for (let i = 1; i < prices.length; i++) {
+    const different = prices[i] - prices[i - 1];
+    if (different > 0) maxProfit += different;
+  }
+
+  return maxProfit;
+}