add 4 solutions

Author: 2xiao

assets/scripts/gen-docs.py

@@ -34,7 +34,7 @@ def gen_solution_list():
         frame_count += 1
 
     table = utils.gen_markdown_table(frame)
-    content = "已完成 {} 道\n\n".format(frame_count) + table + "\n\n由于编译限制，本目录只展示 800 道。\n\n"
+    content = "已完成 {} 道\n\n".format(frame_count) + table + "\n\n由于编译限制，本目录只展示 200 道。\n\n"
 
     with open(const.problem_readme, 'w', encoding='utf-8') as f:
         f.writelines("# 目录\n\n")

assets/scripts/utils.py

@@ -51,8 +51,8 @@ def gen_markdown_table(frame, need_sort = True):
 
 
     # 限制表格中的题数，文件太大会部署失败
-    if len(frame) > 500:
-        frame = frame.head(500)
+    if len(frame) > 200:
+        frame = frame.head(200)
     H = frame.shape[0]
 
     for i in range(H):

src/.vuepress/public/assets/image/beian.png

@@ -949,6 +949,7 @@ export default sidebar({
       "2022",
       "2027",
       "2032",
+      "2033",
       "2037",
       "2042",
       "2044",
@@ -1108,6 +1109,7 @@ export default sidebar({
       "2529",
       "2530",
       "2542",
+      "2551",
       "2554",
       "2558",
       "2559",
@@ -1295,7 +1297,9 @@ export default sidebar({
       "3318",
       "3319",
       "3321",
-      "3356"
+      "3356",
+      "3394",
+      "3396"
     ]
   }
 

src/.vuepress/public/assets/image/leetcode-js-logo.png

@@ -40,10 +40,12 @@ export default hopeTheme(
 
 		print: false,
 
-		footer: '',
+		footer: '<div class="vp-copyright"><p>版权所有，侵权必究 © 2022 - 2025  2xiao</p><p><img src="assets/image/beian.png" style="width: 16px; vertical-align: text-top" alt="">&nbsp;&nbsp;<a href="https://beian.mps.gov.cn/#/query/webSearch?code=11010802045636" rel="noreferrer" target="_blank">京公网安备11010802045636号</a>&nbsp;&nbsp;<a target="_blank" href="https://beian.miit.gov.cn/#/Integrated/index">京ICP备2025118976号</a></p></div>',
 
 		displayFooter: true,
 
+		copyright: false,
+
 		// locales: {
 		//   /**
 		//    * Chinese locale config

src/.vuepress/public/assets/image/react-logo.png

@@ -647,6 +647,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
 <!-- Please keep comment here to allow auto update -->
 <!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
 
+
 ## 相关题目
 
 <!-- prettier-ignore -->
@@ -684,3 +685,4 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
 | 149 | 直线上最多的点数 | [[✓]](/problem/0149.md) |  [`几何`](/tag/geometry.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/max-points-on-a-line) [🔗](https://leetcode.com/problems/max-points-on-a-line) |
 | 359 | 日志速率限制器 🔒 |  |  [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`数据流`](/tag/data-stream.md) | 🟢 | [🀄️](https://leetcode.cn/problems/logger-rate-limiter) [🔗](https://leetcode.com/problems/logger-rate-limiter) |
 | 811 | 子域名访问计数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/subdomain-visit-count) [🔗](https://leetcode.com/problems/subdomain-visit-count) |
+

src/.vuepress/public/assets/image/system-logo.png

@@ -1683,6 +1683,7 @@ x.next = p.next; // 将x的节点的next指针指向b节点；
 <!-- Please keep comment here to allow auto update -->
 <!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
 
+
 ## 相关题目
 
 #### 链表基础题目
@@ -1727,3 +1728,4 @@ x.next = p.next; // 将x的节点的next指针指向b节点；
 | 143 | 重排链表 | [[✓]](/problem/0143.md) |  [`栈`](/tag/stack.md) [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/reorder-list) [🔗](https://leetcode.com/problems/reorder-list) |
 | 2 | 两数相加 | [[✓]](/problem/0002.md) |  [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers) [🔗](https://leetcode.com/problems/add-two-numbers) |
 | 445 | 两数相加 II | [[✓]](/problem/0445.md) |  [`栈`](/tag/stack.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers-ii) [🔗](https://leetcode.com/problems/add-two-numbers-ii) |
+

src/.vuepress/public/assets/image/vue-logo.png

@@ -718,6 +718,7 @@ console.log(priorityQueue.count()); // output: 3
 <!-- Please keep comment here to allow auto update -->
 <!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
 
+
 ## 相关题目
 
 #### 队列基础题目
@@ -743,3 +744,4 @@ console.log(priorityQueue.count()); // output: 3
 | 295 | 数据流的中位数 | [[✓]](/problem/0295.md) |  [`设计`](/tag/design.md) [`双指针`](/tag/two-pointers.md) [`数据流`](/tag/data-stream.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-median-from-data-stream) [🔗](https://leetcode.com/problems/find-median-from-data-stream) |
 | 23 | 合并 K 个升序链表 | [[✓]](/problem/0023.md) |  [`链表`](/tag/linked-list.md) [`分治`](/tag/divide-and-conquer.md) [`堆（优先队列）`](/tag/heap-priority-queue.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/merge-k-sorted-lists) [🔗](https://leetcode.com/problems/merge-k-sorted-lists) |
 | 218 | 天际线问题 |  |  [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/the-skyline-problem) [🔗](https://leetcode.com/problems/the-skyline-problem) |
+

src/.vuepress/sidebar.ts

@@ -619,6 +619,7 @@ var dailyTemperatures = function (temperatures) {
 <!-- Please keep comment here to allow auto update -->
 <!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
 
+
 ## 相关题目
 
 #### 栈基础题目
@@ -653,3 +654,4 @@ var dailyTemperatures = function (temperatures) {
 | 316 | 去除重复字母 | [[✓]](/problem/0316.md) |  [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/remove-duplicate-letters) [🔗](https://leetcode.com/problems/remove-duplicate-letters) |
 | 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) |
 | 85 | 最大矩形 | [[✓]](/problem/0085.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximal-rectangle) [🔗](https://leetcode.com/problems/maximal-rectangle) |
+

src/.vuepress/theme.ts

@@ -1047,6 +1047,7 @@ class NumArray {
 <!-- Please keep comment here to allow auto update -->
 <!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
 
+
 ## 相关题目
 
 #### 二叉树的遍历
@@ -1106,7 +1107,7 @@ class NumArray {
 
 #### 线段树
 
-- 单点更新
+* 单点更新
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1115,7 +1116,7 @@ class NumArray {
 | 307 | 区域和检索 - 数组可修改 | [[✓]](/problem/0307.md) |  [`设计`](/tag/design.md) [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/range-sum-query-mutable) [🔗](https://leetcode.com/problems/range-sum-query-mutable) |
 | 354 | 俄罗斯套娃信封问题 | [[✓]](/problem/0354.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/russian-doll-envelopes) [🔗](https://leetcode.com/problems/russian-doll-envelopes) |
 
-- 区间更新
+* 区间更新
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1127,7 +1128,7 @@ class NumArray {
 | 1310 | 子数组异或查询 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/xor-queries-of-a-subarray) [🔗](https://leetcode.com/problems/xor-queries-of-a-subarray) |
 | 1851 | 包含每个查询的最小区间 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`排序`](/tag/sorting.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-interval-to-include-each-query) [🔗](https://leetcode.com/problems/minimum-interval-to-include-each-query) |
 
-- 区间合并
+* 区间合并
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1136,7 +1137,7 @@ class NumArray {
 | 731 | 我的日程安排表 II | [[✓]](/problem/0731.md) |  [`设计`](/tag/design.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/my-calendar-ii) [🔗](https://leetcode.com/problems/my-calendar-ii) |
 | 732 | 我的日程安排表 III |  |  [`设计`](/tag/design.md) [`线段树`](/tag/segment-tree.md) [`二分查找`](/tag/binary-search.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/my-calendar-iii) [🔗](https://leetcode.com/problems/my-calendar-iii) |
 
-- 扫描线问题
+* 扫描线问题
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1177,3 +1178,4 @@ class NumArray {
 | 947 | 移除最多的同行或同列石头 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`并查集`](/tag/union-find.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column) [🔗](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) |
 | 803 | 打砖块 |  |  [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/bricks-falling-when-hit) [🔗](https://leetcode.com/problems/bricks-falling-when-hit) |
 | 128 | 最长连续序列 | [[✓]](/problem/0128.md) |  [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-consecutive-sequence) [🔗](https://leetcode.com/problems/longest-consecutive-sequence) |
+

src/book/hash.md

@@ -208,17 +208,6 @@ headerDepth: 0
 | 86 | 分隔链表 | [[✓]](/problem/0086.md) |  [`链表`](/tag/linked-list.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/partition-list) [🔗](https://leetcode.com/problems/partition-list) | 18 |
 | 494 | 目标和 | [[✓]](/problem/0494.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/target-sum) [🔗](https://leetcode.com/problems/target-sum) | 17 |
 | 516 | 最长回文子序列 | [[✓]](/problem/0516.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-palindromic-subsequence) [🔗](https://leetcode.com/problems/longest-palindromic-subsequence) | 17 |
-| 115 | 不同的子序列 | [[✓]](/problem/0115.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/distinct-subsequences) [🔗](https://leetcode.com/problems/distinct-subsequences) | 17 |
-| 84 | 柱状图中最大的矩形 | [[✓]](/problem/0084.md) |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🔴 | [🀄️](https://leetcode.cn/problems/largest-rectangle-in-histogram) [🔗](https://leetcode.com/problems/largest-rectangle-in-histogram) | 17 |
-| 97 | 交错字符串 | [[✓]](/problem/0097.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/interleaving-string) [🔗](https://leetcode.com/problems/interleaving-string) | 17 |
-| 264 | 丑数 II | [[✓]](/problem/0264.md) |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/ugly-number-ii) [🔗](https://leetcode.com/problems/ugly-number-ii) | 17 |
-| 剑指 Offer 48 | 最长不含重复字符的子字符串 | [[✓]](/offer/jz_offer_48_1.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof) | 17 |
-| 242 | 有效的字母异位词 | [[✓]](/problem/0242.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-anagram) [🔗](https://leetcode.com/problems/valid-anagram) | 17 |
-| 344 | 反转字符串 | [[✓]](/problem/0344.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-string) [🔗](https://leetcode.com/problems/reverse-string) | 17 |
-| 557 | 反转字符串中的单词 III | [[✓]](/problem/0557.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-words-in-a-string-iii) [🔗](https://leetcode.com/problems/reverse-words-in-a-string-iii) | 17 |
-| 670 | 最大交换 | [[✓]](/problem/0670.md) |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-swap) [🔗](https://leetcode.com/problems/maximum-swap) | 17 |
-| 剑指 Offer 11 | 旋转数组的最小数字 | [[✓]](/offer/jz_offer_11_1.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟢 | [🀄️](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof) | 17 |
-| 191 | 位1的个数 | [[✓]](/problem/0191.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-1-bits) [🔗](https://leetcode.com/problems/number-of-1-bits) | 17 |
 
 
 ::: info

src/book/linked_list.md

@@ -1633,7 +1633,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2549 | 统计桌面上的不同数字 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/count-distinct-numbers-on-board) [🔗](https://leetcode.com/problems/count-distinct-numbers-on-board) |
 | 2550 | 猴子碰撞的方法数 |  |  [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-collisions-of-monkeys-on-a-polygon) [🔗](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon) |
-| 2551 | 将珠子放入背包中 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/put-marbles-in-bags) [🔗](https://leetcode.com/problems/put-marbles-in-bags) |
+| 2551 | 将珠子放入背包中 | [[✓]](/problem/2551.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/put-marbles-in-bags) [🔗](https://leetcode.com/problems/put-marbles-in-bags) |
 | 2552 | 统计上升四元组 |  |  [`树状数组`](/tag/binary-indexed-tree.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-increasing-quadruplets) [🔗](https://leetcode.com/problems/count-increasing-quadruplets) |
 
 
@@ -2856,7 +2856,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2032 | 至少在两个数组中出现的值 | [[✓]](/problem/2032.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-out-of-three) [🔗](https://leetcode.com/problems/two-out-of-three) |
-| 2033 | 获取单值网格的最小操作数 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`矩阵`](/tag/matrix.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid) [🔗](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid) |
+| 2033 | 获取单值网格的最小操作数 | [[✓]](/problem/2033.md) |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`矩阵`](/tag/matrix.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid) [🔗](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid) |
 | 2034 | 股票价格波动 |  |  [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`数据流`](/tag/data-stream.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/stock-price-fluctuation) [🔗](https://leetcode.com/problems/stock-price-fluctuation) |
 | 2035 | 将数组分成两个数组并最小化数组和的差 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference) [🔗](https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference) |