add 7 solutions

Author: 2xiao

assets/origins/categories_list.md

@@ -104,7 +104,7 @@
 
 ### 图的深度优先搜索
 
-###### 0797、0200、0695、0133、0494、0144、0094、0145、0589、0590、0124、0199、0543、0662、0958、0572、0100、0111、0841、0129、0323、0684、0802、0785、0886、0323、0130、0417、1020、1254、1034、jz_offer_13_1、0529
+###### 0797、0200、0695、0133、0494、0144、0094、0145、0589、0590、0124、0199、0543、0662、0958、0572、0100、0111、0841、0129、0323、0684、0802、0785、0886、0130、0417、1020、1254、1034、jz_offer_13_1、0529
 
 ### 图的广度优先搜索
 

src/.vuepress/sidebar.ts

@@ -444,6 +444,7 @@ export default sidebar({
       "0678",
       "0680",
       "0682",
+      "0684",
       "0689",
       "0693",
       "0695",
@@ -493,12 +494,14 @@ export default sidebar({
     "text": "0800-0899",
     "collapsible": true,
     "children": [
+      "0802",
       "0804",
       "0806",
       "0812",
       "0819",
       "0821",
       "0824",
+      "0827",
       "0830",
       "0832",
       "0836",
@@ -701,6 +704,7 @@ export default sidebar({
       "1455",
       "1456",
       "1460",
+      "1462",
       "1464",
       "1466",
       "1470",
@@ -1013,7 +1017,8 @@ export default sidebar({
       "2466",
       "2471",
       "2490",
-      "2491"
+      "2491",
+      "2493"
     ]
   },
   {
@@ -1063,6 +1068,7 @@ export default sidebar({
       "2649",
       "2650",
       "2657",
+      "2658",
       "2661",
       "2665",
       "2666",
@@ -1152,7 +1158,8 @@ export default sidebar({
       "2914",
       "2924",
       "2938",
-      "2940"
+      "2940",
+      "2948"
     ]
   },
   {

src/book/graph.md

@@ -33,11 +33,10 @@
 | 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) |
 | 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) |
 | 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) |
-| 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) |
-| 802 | 找到最终的安全状态 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-eventual-safe-states) [🔗](https://leetcode.com/problems/find-eventual-safe-states) |
+| 684 | 冗余连接 | [[✓]](/problem/0684.md) |  [`深度优先搜索`](/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) |
+| 802 | 找到最终的安全状态 | [[✓]](/problem/0802.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-eventual-safe-states) [🔗](https://leetcode.com/problems/find-eventual-safe-states) |
 | 785 | 判断二分图 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/is-graph-bipartite) [🔗](https://leetcode.com/problems/is-graph-bipartite) |
 | 886 | 可能的二分法 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/possible-bipartition) [🔗](https://leetcode.com/problems/possible-bipartition) |
-| 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) |
 | 130 | 被围绕的区域 | [[✓]](/problem/0130.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/surrounded-regions) [🔗](https://leetcode.com/problems/surrounded-regions) |
 | 417 | 太平洋大西洋水流问题 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/pacific-atlantic-water-flow) [🔗](https://leetcode.com/problems/pacific-atlantic-water-flow) |
 | 1020 | 飞地的数量 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-enclaves) [🔗](https://leetcode.com/problems/number-of-enclaves) |
@@ -79,7 +78,7 @@
 | 210 | 课程表 II | [[✓]](/problem/0210.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/course-schedule-ii) [🔗](https://leetcode.com/problems/course-schedule-ii) |
 | 1136 | 并行课程 🔒 |  |  [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) | 🟠 | [🀄️](https://leetcode.cn/problems/parallel-courses) [🔗](https://leetcode.com/problems/parallel-courses) |
 | 2050 | 并行课程 III |  |  [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) [`数组`](/tag/array.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/parallel-courses-iii) [🔗](https://leetcode.com/problems/parallel-courses-iii) |
-| 802 | 找到最终的安全状态 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-eventual-safe-states) [🔗](https://leetcode.com/problems/find-eventual-safe-states) |
+| 802 | 找到最终的安全状态 | [[✓]](/problem/0802.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-eventual-safe-states) [🔗](https://leetcode.com/problems/find-eventual-safe-states) |
 | 851 | 喧闹和富有 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/loud-and-rich) [🔗](https://leetcode.com/problems/loud-and-rich) |
 
 #### 图的最小生成树

src/book/tree.md

@@ -1167,7 +1167,7 @@ class NumArray {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 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) |
 | 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) |
-| 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) |
+| 684 | 冗余连接 | [[✓]](/problem/0684.md) |  [`深度优先搜索`](/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) |
 | 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) |
 | 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) |
 | 399 | 除法求值 | [[✓]](/problem/0399.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `4+` | 🟠 | [🀄️](https://leetcode.cn/problems/evaluate-division) [🔗](https://leetcode.com/problems/evaluate-division) |

src/plan/company_list.md

@@ -94,7 +94,7 @@ headerDepth: 0
 | 238 | 除自身以外数组的乘积 | [[✓]](/problem/0238.md) |  [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/product-of-array-except-self) [🔗](https://leetcode.com/problems/product-of-array-except-self) | 12 |
 | 1539 | 第 k 个缺失的正整数 | [[✓]](/problem/1539.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟢 | [🀄️](https://leetcode.cn/problems/kth-missing-positive-number) [🔗](https://leetcode.com/problems/kth-missing-positive-number) | 12 |
 | 125 | 验证回文串 | [[✓]](/problem/0125.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-palindrome) [🔗](https://leetcode.com/problems/valid-palindrome) | 12 |
-| 827 | 最大人工岛 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/making-a-large-island) [🔗](https://leetcode.com/problems/making-a-large-island) | 12 |
+| 827 | 最大人工岛 | [[✓]](/problem/0827.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/making-a-large-island) [🔗](https://leetcode.com/problems/making-a-large-island) | 12 |
 | 199 | 二叉树的右视图 | [[✓]](/problem/0199.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/binary-tree-right-side-view) [🔗](https://leetcode.com/problems/binary-tree-right-side-view) | 12 |
 | 746 | 使用最小花费爬楼梯 | [[✓]](/problem/0746.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/min-cost-climbing-stairs) [🔗](https://leetcode.com/problems/min-cost-climbing-stairs) | 12 |
 | 158 | 用 Read4 读取 N 个字符 II - 多次调用 🔒 |  |  [`数组`](/tag/array.md) [`交互`](/tag/interactive.md) [`模拟`](/tag/simulation.md) | 🔴 | [🀄️](https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times) [🔗](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) | 12 |

src/plan/contest_list.md

@@ -853,7 +853,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2946 | 循环移位后的矩阵相似检查 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`矩阵`](/tag/matrix.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/matrix-similarity-after-cyclic-shifts) [🔗](https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts) |
 | 2947 | 统计美丽子字符串 I |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-beautiful-substrings-i) [🔗](https://leetcode.com/problems/count-beautiful-substrings-i) |
-| 2948 | 交换得到字典序最小的数组 |  |  [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/make-lexicographically-smallest-array-by-swapping-elements) [🔗](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements) |
+| 2948 | 交换得到字典序最小的数组 | [[✓]](/problem/2948.md) |  [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/make-lexicographically-smallest-array-by-swapping-elements) [🔗](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements) |
 | 2949 | 统计美丽子字符串 II |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-beautiful-substrings-ii) [🔗](https://leetcode.com/problems/count-beautiful-substrings-ii) |
 
 
@@ -1405,7 +1405,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2656 | K 个元素的最大和 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements) [🔗](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements) |
 | 2657 | 找到两个数组的前缀公共数组 | [[✓]](/problem/2657.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays) [🔗](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays) |
-| 2658 | 网格图中鱼的最大数目 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid) [🔗](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid) |
+| 2658 | 网格图中鱼的最大数目 | [[✓]](/problem/2658.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid) [🔗](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid) |
 | 2659 | 将数组清空 |  |  [`贪心`](/tag/greedy.md) [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/make-array-empty) [🔗](https://leetcode.com/problems/make-array-empty) |
 
 
@@ -1778,7 +1778,7 @@ headerDepth: 0
 | 2490 | 回环句 | [[✓]](/problem/2490.md) |  [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/circular-sentence) [🔗](https://leetcode.com/problems/circular-sentence) |
 | 2491 | 划分技能点相等的团队 | [[✓]](/problem/2491.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/divide-players-into-teams-of-equal-skill) [🔗](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill) |
 | 2492 | 两个城市间路径的最小分数 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-score-of-a-path-between-two-cities) [🔗](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities) |
-| 2493 | 将节点分成尽可能多的组 |  |  [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) [`图`](/tag/graph.md) | 🔴 | [🀄️](https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups) [🔗](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups) |
+| 2493 | 将节点分成尽可能多的组 | [[✓]](/problem/2493.md) |  [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) [`图`](/tag/graph.md) | 🔴 | [🀄️](https://leetcode.cn/problems/divide-nodes-into-the-maximum-number-of-groups) [🔗](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups) |
 
 
 ## Weekly Contest 321 (2022-11-27 10:30)
@@ -4141,7 +4141,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 1460 | 通过翻转子数组使两个数组相等 | [[✓]](/problem/1460.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-subarrays) [🔗](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays) |
 | 1461 | 检查一个字符串是否包含所有长度为 K 的二进制子串 |  |  [`位运算`](/tag/bit-manipulation.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k) [🔗](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k) |
-| 1462 | 课程表 IV |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/course-schedule-iv) [🔗](https://leetcode.com/problems/course-schedule-iv) |
+| 1462 | 课程表 IV | [[✓]](/problem/1462.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/course-schedule-iv) [🔗](https://leetcode.com/problems/course-schedule-iv) |
 | 1463 | 摘樱桃 II |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/cherry-pickup-ii) [🔗](https://leetcode.com/problems/cherry-pickup-ii) |