Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 2eb2b72

Browse files
committed
Deploying to main from @ 2xiao/leetcode-js@fe839c5 🚀
1 parent c28e37c commit 2eb2b72

34 files changed

+1581
-46
lines changed

‎book/graph.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,7 @@
3030
| 572 | 另一棵树的子树 | [[✓]](/problem/0572.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉树`](/tag/binary-tree.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/subtree-of-another-tree) [🔗](https://leetcode.com/problems/subtree-of-another-tree) |
3131
| 100 | 相同的树 | [[✓]](/problem/0100.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/same-tree) [🔗](https://leetcode.com/problems/same-tree) |
3232
| 111 | 二叉树的最小深度 | [[✓]](/problem/0111.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-depth-of-binary-tree) [🔗](https://leetcode.com/problems/minimum-depth-of-binary-tree) |
33-
| 841 | 钥匙和房间 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) |
33+
| 841 | 钥匙和房间 | [[✓]](/problem/0841.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) |
3434
| 129 | 求根节点到叶节点数字之和 | [[✓]](/problem/0129.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉树`](/tag/binary-tree.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-root-to-leaf-numbers) [🔗](https://leetcode.com/problems/sum-root-to-leaf-numbers) |
3535
| 323 | 无向图中连通分量的数目 🔒 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph) [🔗](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) |
3636
| 684 | 冗余连接 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/redundant-connection) [🔗](https://leetcode.com/problems/redundant-connection) |

‎book/tree.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1166,7 +1166,7 @@ class NumArray {
11661166
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
11671167
| :------: | :------ | :------: | :------ | :------: | :------: |
11681168
| 990 | 等式方程的可满足性 | | [`并查集`](/tag/union-find.md) [`图`](/tag/graph.md) [`数组`](/tag/array.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/satisfiability-of-equality-equations) [🔗](https://leetcode.com/problems/satisfiability-of-equality-equations) |
1169-
| 547 | 省份数量 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-provinces) [🔗](https://leetcode.com/problems/number-of-provinces) |
1169+
| 547 | 省份数量 | [[✓]](/problem/0547.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-provinces) [🔗](https://leetcode.com/problems/number-of-provinces) |
11701170
| 684 | 冗余连接 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/redundant-connection) [🔗](https://leetcode.com/problems/redundant-connection) |
11711171
| 1319 | 连通网络的操作次数 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-operations-to-make-network-connected) [🔗](https://leetcode.com/problems/number-of-operations-to-make-network-connected) |
11721172
| 765 | 情侣牵手 | | [`贪心`](/tag/greedy.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/couples-holding-hands) [🔗](https://leetcode.com/problems/couples-holding-hands) |

‎plan/codetop_list.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,7 @@ headerDepth: 0
112112
| 138 | 随机链表的复制 | [[✓]](/problem/0138.md) | [`哈希表`](/tag/hash-table.md) [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/copy-list-with-random-pointer) [🔗](https://leetcode.com/problems/copy-list-with-random-pointer) | 47 |
113113
| 739 | 每日温度 | [[✓]](/problem/0739.md) | [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🟠 | [🀄️](https://leetcode.cn/problems/daily-temperatures) [🔗](https://leetcode.com/problems/daily-temperatures) | 46 |
114114
| 136 | 只出现一次的数字 | [[✓]](/problem/0136.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) | 45 |
115-
| 460 | LFU 缓存 | | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`链表`](/tag/linked-list.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/lfu-cache) [🔗](https://leetcode.com/problems/lfu-cache) | 45 |
115+
| 460 | LFU 缓存 | [[✓]](/problem/0460.md) | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`链表`](/tag/linked-list.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/lfu-cache) [🔗](https://leetcode.com/problems/lfu-cache) | 45 |
116116
| 剑指 Offer 9 | 用两个栈实现队列 | [[✓]](/offer/jz_offer_09_1.md) | [`栈`](/tag/stack.md) [`设计`](/tag/design.md) [`队列`](/tag/queue.md) | 🟢 | [🀄️](https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof) | 44 |
117117
| 402 | 移掉 K 位数字 | | [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/remove-k-digits) [🔗](https://leetcode.com/problems/remove-k-digits) | 44 |
118118
| 11 | 盛最多水的容器 | [[✓]](/problem/0011.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/container-with-most-water) [🔗](https://leetcode.com/problems/container-with-most-water) | 43 |

‎plan/company_list.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -48,7 +48,7 @@ headerDepth: 0
4848
| 741 | 摘樱桃 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/cherry-pickup) [🔗](https://leetcode.com/problems/cherry-pickup) | 10 |
4949
| 538 | 把二叉搜索树转换为累加树 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉搜索树`](/tag/binary-search-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/convert-bst-to-greater-tree) [🔗](https://leetcode.com/problems/convert-bst-to-greater-tree) | 8 |
5050
| 2184 | 建造坚实的砖墙的方法数 🔒 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall) [🔗](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall) | 8 |
51-
| 841 | 钥匙和房间 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) | 5 |
51+
| 841 | 钥匙和房间 | [[✓]](/problem/0841.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) | 5 |
5252
| 463 | 岛屿的周长 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
5353
| 1568 | 使陆地分离的最少天数 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island) [🔗](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island) | 2 |
5454

@@ -247,7 +247,7 @@ headerDepth: 0
247247
| 125 | 验证回文串 | [[✓]](/problem/0125.md) | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-palindrome) [🔗](https://leetcode.com/problems/valid-palindrome) | 18 |
248248
| 100 | 相同的树 | [[✓]](/problem/0100.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/same-tree) [🔗](https://leetcode.com/problems/same-tree) | 18 |
249249
| 19 | 删除链表的倒数第 N 个结点 | [[✓]](/problem/0019.md) | [`链表`](/tag/linked-list.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/remove-nth-node-from-end-of-list) [🔗](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | 18 |
250-
| 460 | LFU 缓存 | | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`链表`](/tag/linked-list.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/lfu-cache) [🔗](https://leetcode.com/problems/lfu-cache) | 17 |
250+
| 460 | LFU 缓存 | [[✓]](/problem/0460.md) | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`链表`](/tag/linked-list.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/lfu-cache) [🔗](https://leetcode.com/problems/lfu-cache) | 17 |
251251
| 4 | 寻找两个正序数组的中位数 | [[✓]](/problem/0004.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`分治`](/tag/divide-and-conquer.md) | 🔴 | [🀄️](https://leetcode.cn/problems/median-of-two-sorted-arrays) [🔗](https://leetcode.com/problems/median-of-two-sorted-arrays) | 17 |
252252
| 102 | 二叉树的层序遍历 | [[✓]](/problem/0102.md) | [`树`](/tag/tree.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`二叉树`](/tag/binary-tree.md) | 🟠 | [🀄️](https://leetcode.cn/problems/binary-tree-level-order-traversal) [🔗](https://leetcode.com/problems/binary-tree-level-order-traversal) | 16 |
253253
| 42 | 接雨水 | [[✓]](/problem/0042.md) | [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/trapping-rain-water) [🔗](https://leetcode.com/problems/trapping-rain-water) | 16 |

‎plan/contest_list.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2988,7 +2988,7 @@ headerDepth: 0
29882988
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
29892989
| :------: | :------ | :------: | :------ | :------: | :------: |
29902990
| 1974 | 使用特殊打字机键入单词的最少时间 | | [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-time-to-type-word-using-special-typewriter) [🔗](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter) |
2991-
| 1975 | 最大方阵和 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-matrix-sum) [🔗](https://leetcode.com/problems/maximum-matrix-sum) |
2991+
| 1975 | 最大方阵和 | [[✓]](/problem/1975.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-matrix-sum) [🔗](https://leetcode.com/problems/maximum-matrix-sum) |
29922992
| 1976 | 到达目的地的方案数 | | [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-arrive-at-destination) [🔗](https://leetcode.com/problems/number-of-ways-to-arrive-at-destination) |
29932993
| 1977 | 划分数字的方案数 | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) [`后缀数组`](/tag/suffix-array.md) | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-separate-numbers) [🔗](https://leetcode.com/problems/number-of-ways-to-separate-numbers) |
29942994

@@ -4129,7 +4129,7 @@ headerDepth: 0
41294129
| :------: | :------ | :------: | :------ | :------: | :------: |
41304130
| 1464 | 数组中两元素的最大乘积 | | [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) [`堆(优先队列)`](/tag/heap-priority-queue.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array) [🔗](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array) |
41314131
| 1465 | 切割后面积最大的蛋糕 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts) [🔗](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts) |
4132-
| 1466 | 重新规划路线 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero) [🔗](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
4132+
| 1466 | 重新规划路线 | [[✓]](/problem/1466.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero) [🔗](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero) |
41334133
| 1467 | 两个盒子中球的颜色数相同的概率 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `3+` | 🔴 | [🀄️](https://leetcode.cn/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls) [🔗](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls) |
41344134

41354135

@@ -4872,7 +4872,7 @@ headerDepth: 0
48724872
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
48734873
| :------: | :------ | :------: | :------ | :------: | :------: |
48744874
| 1160 | 拼写单词 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/find-words-that-can-be-formed-by-characters) [🔗](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters) |
4875-
| 1161 | 最大层内元素和 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree) [🔗](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree) |
4875+
| 1161 | 最大层内元素和 | [[✓]](/problem/1161.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-level-sum-of-a-binary-tree) [🔗](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree) |
48764876
| 1162 | 地图分析 | | [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/as-far-from-land-as-possible) [🔗](https://leetcode.com/problems/as-far-from-land-as-possible) |
48774877
| 1163 | 按字典序排在最后的子串 | | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🔴 | [🀄️](https://leetcode.cn/problems/last-substring-in-lexicographical-order) [🔗](https://leetcode.com/problems/last-substring-in-lexicographical-order) |
48784878

@@ -5712,7 +5712,7 @@ headerDepth: 0
57125712
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
57135713
| :------: | :------ | :------: | :------ | :------: | :------: |
57145714
| 840 | 矩阵中的幻方 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/magic-squares-in-grid) [🔗](https://leetcode.com/problems/magic-squares-in-grid) |
5715-
| 841 | 钥匙和房间 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) |
5715+
| 841 | 钥匙和房间 | [[✓]](/problem/0841.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) |
57165716
| 842 | 将数组拆分成斐波那契序列 | | [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/split-array-into-fibonacci-sequence) [🔗](https://leetcode.com/problems/split-array-into-fibonacci-sequence) |
57175717
| 843 | 猜猜这个单词 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/guess-the-word) [🔗](https://leetcode.com/problems/guess-the-word) |
57185718

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /