@@ -107,7 +107,7 @@ headerDepth: 0
107107| 236 | [ 二叉树的最近公共祖先] ( https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0236 ) | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 二叉树 ` ] ( /leetcode/outline/tag/binary-tree.md ) | <font color =#ffb800 >Medium</font > |
108108| 222 | [ 完全二叉树的节点个数] ( https://leetcode.com/problems/count-complete-tree-nodes ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0222 ) | [ ` 位运算 ` ] ( /leetcode/outline/tag/bit-manipulation.md ) [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 二分查找 ` ] ( /leetcode/outline/tag/binary-search.md ) ` 1+ ` | <font color =#15bd66 >Easy</font > |
109109| 113 | [ 路径总和 II] ( https://leetcode.com/problems/path-sum-ii ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0113 ) | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 回溯 ` ] ( /leetcode/outline/tag/backtracking.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
110- | 437 | [ 路径总和 III] ( https://leetcode.com/problems/path-sum-iii ) | | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 二叉树 ` ] ( /leetcode/outline/tag/binary-tree.md ) | <font color =#ffb800 >Medium</font > |
110+ | 437 | [ 路径总和 III] ( https://leetcode.com/problems/path-sum-iii ) | [[ ✓ ]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0437 ) | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 二叉树 ` ] ( /leetcode/outline/tag/binary-tree.md ) | <font color =#ffb800 >Medium</font > |
111111| 129 | [ 求根节点到叶节点数字之和] ( https://leetcode.com/problems/sum-root-to-leaf-numbers ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0129 ) | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 二叉树 ` ] ( /leetcode/outline/tag/binary-tree.md ) | <font color =#ffb800 >Medium</font > |
112112| 662 | [ 二叉树最大宽度] ( https://leetcode.com/problems/maximum-width-of-binary-tree ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0662 ) | [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
113113| 114 | [ 二叉树展开为链表] ( https://leetcode.com/problems/flatten-binary-tree-to-linked-list ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0114 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 树 ` ] ( /leetcode/outline/tag/tree.md ) [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) ` 2+ ` | <font color =#ffb800 >Medium</font > |
@@ -210,7 +210,7 @@ headerDepth: 0
210210| 316 | [ 去除重复字母] ( https://leetcode.com/problems/remove-duplicate-letters ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0316 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 贪心 ` ] ( /leetcode/outline/tag/greedy.md ) [ ` 字符串 ` ] ( /leetcode/outline/tag/string.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
211211| 1124 | [ 表现良好的最长时间段] ( https://leetcode.com/problems/longest-well-performing-interval ) | | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) ` 2+ ` | <font color =#ffb800 >Medium</font > |
212212| 42 | [ 接雨水] ( https://leetcode.com/problems/trapping-rain-water ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0042 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 双指针 ` ] ( /leetcode/outline/tag/two-pointers.md ) ` 2+ ` | <font color =#ff334b >Hard</font > |
213- | 84 | [ 柱状图中最大的矩形] ( https://leetcode.com/problems/largest-rectangle-in-histogram ) | | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 单调栈 ` ] ( /leetcode/outline/tag/monotonic-stack.md ) | <font color =#ff334b >Hard</font > |
213+ | 84 | [ 柱状图中最大的矩形] ( https://leetcode.com/problems/largest-rectangle-in-histogram ) | [[ ✓ ]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0084 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 单调栈 ` ] ( /leetcode/outline/tag/monotonic-stack.md ) | <font color =#ff334b >Hard</font > |
214214| 85 | [ 最大矩形] ( https://leetcode.com/problems/maximal-rectangle ) | [[ ✓]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0085 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 2+ ` | <font color =#ff334b >Hard</font > |
215215| 321 | [ 拼接最大数] ( https://leetcode.com/problems/create-maximum-number ) | | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 贪心 ` ] ( /leetcode/outline/tag/greedy.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) ` 2+ ` | <font color =#ff334b >Hard</font > |
216216
@@ -427,7 +427,7 @@ headerDepth: 0
427427| 1319 | [ 连通网络的操作次数] ( https://leetcode.com/problems/number-of-operations-to-make-network-connected ) | | [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 并查集 ` ] ( /leetcode/outline/tag/union-find.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
428428| 934 | [ 最短的桥] ( https://leetcode.com/problems/shortest-bridge ) | | [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
429429| 785 | [ 判断二分图] ( https://leetcode.com/problems/is-graph-bipartite ) | | [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 并查集 ` ] ( /leetcode/outline/tag/union-find.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
430- | 994 | [ 腐烂的橘子] ( https://leetcode.com/problems/rotting-oranges ) | | [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 矩阵 ` ] ( /leetcode/outline/tag/matrix.md ) | <font color =#ffb800 >Medium</font > |
430+ | 994 | [ 腐烂的橘子] ( https://leetcode.com/problems/rotting-oranges ) | [[ ✓ ]] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0994 ) | [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 矩阵 ` ] ( /leetcode/outline/tag/matrix.md ) | <font color =#ffb800 >Medium</font > |
431431| 752 | [ 打开转盘锁] ( https://leetcode.com/problems/open-the-lock ) | | [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
432432| 1162 | [ 地图分析] ( https://leetcode.com/problems/as-far-from-land-as-possible ) | | [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
433433| 529 | [ 扫雷游戏] ( https://leetcode.com/problems/minesweeper ) | | [ ` 深度优先搜索 ` ] ( /leetcode/outline/tag/depth-first-search.md ) [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
0 commit comments