add 2458

Author: 2xiao

assets/output/3329.md

@@ -0,0 +1,20 @@
+# [3329. 字符至少出现 K 次的子字符串 II](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-ii)
+
+🔴 <font color=#ff334b>Hard</font>&emsp; 🔖&ensp; [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md)&emsp; 🔗&ensp;[`LeetCode`](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-ii)
+
+## 题目
+
+## 题目大意
+
+## 解题思路
+
+#### 复杂度分析
+
+- **时间复杂度**：`O()`，
+- **空间复杂度**：`O()`，
+
+## 代码
+
+```javascript
+
+```

assets/scripts/gen-docs.py

@@ -173,7 +173,6 @@ def gen_plan_list(plan_name, salt=False, path=None):
     f = open(origin_path, encoding='utf-8')
     lines = f.readlines()
     file_content = ""
-    count = 0
 
     for i in range(len(lines)):
         pattern = re.compile(r'(#{1,6}) (.*)')
@@ -206,6 +205,27 @@ def gen_plan_list(plan_name, salt=False, path=None):
     print("Create " + plan_name + " Success")
 
 
+def update_content():
+    files = os.listdir(const.problem_path)
+    for file in files:
+        # 判断是否是文件夹
+        if ".md" not in file:
+            continue
+        if "README" in file:
+            continue
+        print(Path(file))
+        old_path = os.path.join(const.problem_path, Path(file))
+        old_content = Path(old_path).read_text(encoding='utf-8')
+
+        new_path = os.path.join('../output/', Path(file))
+        new_content = Path(new_path).read_text(encoding='utf-8')
+
+        delim = '## 解题思路\n'
+
+        text = new_content.split(delim)[0] + delim + old_content.split(delim)[1]
+
+        Path(old_path).write_text(text, encoding='utf-8')
+
 # 更新题目详解页面的相关题目和标签
 
 def update_similar():

assets/scripts/leetcode-spider.py

@@ -3,7 +3,6 @@
 
 import sqlite3
 import json
-import traceback
 import html2text
 import os
 import requests
@@ -13,7 +12,6 @@
 import argparse,sys
 import threading
 import pandas as pd
-import const
 import utils
 
 db_path = 'leetcode.db'
@@ -336,6 +334,7 @@ def generate_questions_list(self):
             }
             res.append(question_detail)
 
+        res.sort(key=lambda x: x['fileName']) # 对 res 进行排序
         with open(file_name, 'w', encoding='utf-8', newline='') as f:
             import csv
             writer = csv.DictWriter(f, fieldnames=res[0].keys())
@@ -387,7 +386,7 @@ def generate_question_markdown(self, question, path, has_get_code):
             contentCN = html2text.html2text(textCN).replace("    \n    \n    **Input:**", "> Input:").replace("    **Output:**", "> \n> Output:").replace('    **Explanation:**', '> \n> Explanation:').replace('    - ', '> - ').replace('    \n\n**Example', '\n**Example').replace('    \n\n\n\n**Constraints:', '\n**Constraints:').replace('    ', '> \n> ').replace('103`', '10^3`').replace('104`', '10^4`').replace('105`', '10^5`').replace('106`', '10^6`').replace('107`', '10^7`').replace('108`', '10^8`').replace('109`', '10^9`').replace('`-103', '`-10^3').replace('`-104', '`-10^4').replace('`-105', '`-10^5').replace('`-106', '`-10^6').replace('`-107', '`-10^7').replace('`-108', '`-10^8').replace('`-109', '`-10^9')
             f.write(contentCN)
 
-            f.write("\n## 解题思路\n\n#### 复杂度分析\n\n- **时间复杂度**：`O()`，\n- **空间复杂度**：`O()`，\n\n## 代码\n\n```javascript\n\n```")
+            f.write("\n\n## 解题思路\n\n#### 复杂度分析\n\n- **时间复杂度**：`O()`，\n- **空间复杂度**：`O()`，\n\n## 代码\n\n```javascript\n\n```")
 
             similar = json.loads(question['similar'])
             if len(similar) > 0:
@@ -488,9 +487,9 @@ def close_db(self):
 
 
     test.connect_db(db_path)
-    test.get_problems(filters)
+    # test.get_problems(filters)
 
-    test.generate_questions_list()
+    # test.generate_questions_list()
     test.generate_questions_markdown(args.output, filters)
 
     test.close_db()

assets/scripts/problem-list.csv

@@ -519,6 +519,7 @@ export default sidebar({
     "children": [
       "2406",
       "2416",
+      "2458",
       "2491"
     ]
   },
@@ -540,6 +541,7 @@ export default sidebar({
       "2621",
       "2622",
       "2623",
+      "2624",
       "2625",
       "2626",
       "2627",

src/.vuepress/sidebar.ts

@@ -40,7 +40,7 @@
 
 ## 解题思路
 
-这道题和 [第 200 题 岛屿数量](./0200.md) 的解题思路是一样的，只不过需要给 dfs 函数加一个返回值，记录岛屿的面积。
+这道题和 [第 200 题 岛屿数量](../problem/0200.md) 的解题思路是一样的，只不过需要给 dfs 函数加一个返回值，记录岛屿的面积。
 
 遍历整个网格，并在每次找到一个陆地单元时，使用深度优先搜索（DFS）或广度优先搜索（BFS）来遍历所有相连的陆地单元，从而将整个岛屿标记为已访问。
 

src/offer2/jz_offer_II_105.md

@@ -1862,7 +1862,7 @@ headerDepth: 0
 | 2455 | [可被三整除的偶数的平均值](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three) |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) | <font color=#15bd66>Easy</font> |
 | 2456 | [最流行的视频创作者](https://leetcode.com/problems/most-popular-video-creator) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | <font color=#ffb800>Medium</font> |
 | 2457 | [美丽整数的最小增量](https://leetcode.com/problems/minimum-addition-to-make-integer-beautiful) |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) | <font color=#ffb800>Medium</font> |
-| 2458 | [移除子树后的二叉树高度](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | <font color=#ff334b>Hard</font> |
+| 2458 | [移除子树后的二叉树高度](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) | [[✓]](/problem/2458.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | <font color=#ff334b>Hard</font> |
 
 
 ## Biweekly Contest 90 (2022-10-29 22:30)

src/plan/contest_list.md

@@ -14,7 +14,7 @@ headerDepth: 0
 | 2621 | [睡眠函数](https://leetcode.com/problems/sleep) | [[✓]](/problem/2621.md) |  | <font color=#15bd66>Easy</font> |
 | 2622 | [有时间限制的缓存](https://leetcode.com/problems/cache-with-time-limit) | [[✓]](/problem/2622.md) |  | <font color=#ffb800>Medium</font> |
 | 2623 | [记忆函数](https://leetcode.com/problems/memoize) | [[✓]](/problem/2623.md) |  | <font color=#ffb800>Medium</font> |
-| 2624 | [蜗牛排序](https://leetcode.com/problems/snail-traversal) |  |  | <font color=#ffb800>Medium</font> |
+| 2624 | [蜗牛排序](https://leetcode.com/problems/snail-traversal) | [[✓]](/problem/2624.md) |  | <font color=#ffb800>Medium</font> |
 | 2625 | [扁平化嵌套数组](https://leetcode.com/problems/flatten-deeply-nested-array) | [[✓]](/problem/2625.md) |  | <font color=#ffb800>Medium</font> |
 | 2626 | [数组归约运算](https://leetcode.com/problems/array-reduce-transformation) | [[✓]](/problem/2626.md) |  | <font color=#15bd66>Easy</font> |
 | 2627 | [函数防抖](https://leetcode.com/problems/debounce) | [[✓]](/problem/2627.md) |  | <font color=#ffb800>Medium</font> |

src/plan/js_list.md

@@ -91,4 +91,4 @@ var maxDepth = function (root) {
 | 559 | [N 叉树的最大深度](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | [[✓]](/problem/0559.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) | <font color=#15bd66>Easy</font> |
 | 1376 | [通知所有员工所需的时间](https://leetcode.com/problems/time-needed-to-inform-all-employees) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) | <font color=#ffb800>Medium</font> |
 | 2385 | [感染二叉树需要的总时间](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | <font color=#ffb800>Medium</font> |
-| 2458 | [移除子树后的二叉树高度](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | <font color=#ff334b>Hard</font> |
+| 2458 | [移除子树后的二叉树高度](https://leetcode.com/problems/height-of-binary-tree-after-subtree-removal-queries) | [[✓]](/problem/2458.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `2+` | <font color=#ff334b>Hard</font> |

src/problem/0104.md

@@ -34,6 +34,14 @@ _Nary-Tree input serialization is represented in their level order traversal, ea
 
 ## 题目大意
 
+给定一个 N 叉树，找到其最大深度。
+
+最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。
+
+N 叉树输入按层序遍历序列化表示，每组子节点由空值分隔（请参见示例）。
+
+## 解题思路
+
 思路和 [第 104 题 二叉树的最大深度](./0104.md) 一样。
 
 ### 思路一：递归