update

Author: tangweikun

CATEGORY.md

@@ -1,67 +1,95 @@
-- 1.数组
-
-- 2.贪心算法
-  435、881
-
-- 3.深度优先搜索 Depth First Search
-  1315 841
-
-- 4.栈、队列
-  649 1249 1209 402
-
-- 5.迭代器
-  94(中序遍历) 144(前序遍历)
-
-- 6.动态规划
-  983 1262 322 1423 152 1218 1367 801 523 91 1477 474
-  673
-
-- 7.双指针
-  881
-
-- 8.哈希表
-  781 523
-
-- 9.链表
-  148
-
-- 10.回溯算法
-  491 1498
-
-- 11.窗口滑动
-  1054
-
-- 12.位运算
-  201 1404
-
-* 字符串
-
-* 排序
-
-- KMP
-- 递归
-
-- 广度优先搜索
-
-- 前缀和
+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
 
-https://ojeveryday.com/
+  - [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
 
-https://labuladong.gitbook.io/algo/di-ling-zhang-bi-du-xi-lie/gitbook
+- Backtracking
 
-https://github.com/garciparedes
+  - [ ] 17
+  - [ ] 22
+  - [ ] 39
+  - [ ] 40
+  - [ ] 46
+  - [ ] 47
+  - [ ] 60
+  - [ ] 77
+  - [ ] 78
+  - [ ] 90
+  - [ ] 131
+  - [ ] 211
+  - [ ] 216
+  - [ ] 306
+  - [ ] 357
+  - [ ] 872
 
-https://garciparedes.me/#headers
+- 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
@@ -83,34 +111,100 @@ https://garciparedes.me/#headers
   - [ ] 357
   - [ ] 376
 
-- 数组
+- Greedy
 
-  - [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
-  - [ ] 80
-  - [ ] 88
-  - [ ] 90
-  - [ ] 118
-  - [ ] 119
-  - [ ] 120
-  - [ ] 121
   - [ ] 122
-  - [ ] 152
-  - [ ] 153
-  - [ ] 154
+  - [ ] 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

src/101-symmetric-tree/index.js

@@ -1,18 +1,21 @@
 // Recursive
-// HELP:
 
-export const isSymmetric = root => {
-  return isMirror(root, root);
-};
+export const isSymmetric = (root) => {
+  return dfs(root, root);
 
-function isMirror(t1, t2) {
-  if (t1 && t2) {
-    return (
-      t1.val === t2.val &&
-      isMirror(t1.right, t2.left) &&
-      isMirror(t1.left, t2.right)
-    );
-  }
+  function dfs(left, right) {
+    if (!left && !right) {
+      return true;
+    }
+
+    if (!left || !right) {
+      return false;
+    }
 
-  return t1 === t2;
-}
+    if (left.val !== right.val) {
+      return false;
+    }
+
+    return dfs(left.left, right.right) && dfs(left.right, right.left);
+  }
+};

src/110-balanced-binary-tree/index.js

@@ -1,13 +1,17 @@
-export const isBalanced = root => {
+export const isBalanced = (root) => {
   let res = true;
   dfs(root);
   return res;
 
   function dfs(node) {
     if (!node) return 0;
-    const a = dfs(node.left);
-    const b = dfs(node.right);
-    if (Math.abs(a - b) > 1) res = false;
-    return Math.max(a, b) + 1;
+    const leftHeight = dfs(node.left);
+    const rightHeight = dfs(node.right);
+
+    if (Math.abs(leftHeight - rightHeight) > 1) {
+      res = false;
+    }
+
+    return Math.max(leftHeight, rightHeight) + 1;
   }
 };

src/111-minimum-depth-of-binary-tree/index.js

@@ -1,19 +1,25 @@
-// Depth-First-Search
-// HELP:
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var minDepth = function (root) {
+  let res = Infinity;
+  dfs(root, 0);
+  return res === Infinity ? 0 : res;
 
-export const minDepth = function(root) {
-  let min = Infinity;
-  dfs(root, 1);
-  return min === Infinity ? 0 : min;
-
-  function dfs(node, depth) {
-    if (!node || depth >= min) return;
+  function dfs(node, count) {
+    if (!node) return;
     if (!node.left && !node.right) {
-      min = depth;
-      return;
+      res = Math.min(res, count + 1);
     }
-
-    if (node.left) dfs(node.left, depth + 1);
-    if (node.right) dfs(node.right, depth + 1);
+    dfs(node.left, count + 1);
+    dfs(node.right, count + 1);
   }
 };