add 7 solutions

Author: 2xiao

assets/scripts/gen-docs.py

@@ -29,13 +29,12 @@ def gen_solution_list():
         if not df_indexs:
             print('%s 没有出现在 problem-list.csv 中' % (Path(file).stem))
             continue
-
         res = utils.gen_frame_items(df_indexs[0], df)
         frame.loc[frame_count] = res
         frame_count += 1
 
     table = utils.gen_markdown_table(frame)
-    content = "已完成 {} 道\n\n".format(frame_count) + table + "\n\n"
+    content = "已完成 {} 道\n\n".format(frame_count) + table + "\n\n由于编译限制，本目录只展示 800 道。\n\n"
 
     with open(const.problem_readme, 'w', encoding='utf-8') as f:
         f.writelines("# 目录\n\n")

assets/scripts/utils.py

@@ -21,7 +21,6 @@ def custom_sort(val):
 
 def gen_markdown_table(frame, need_sort = True):
 
-    H = frame.shape[0]
     W = frame.shape[1]
 
     head_name = ["题号", "标题", "题解", "标签", "难度", "力扣", "频次"]
@@ -44,11 +43,18 @@ def gen_markdown_table(frame, need_sort = True):
         else:
             line = "{} {} |".format(line, SPLIT2.format('-'*6))
     lines += [line]
-
+   
     # 数据部分
     if need_sort:
         frame = frame.sort_values(by='题号', key=lambda col: col.apply(custom_sort))
     frame = frame.reset_index(drop=True)
+
+
+    # 限制表格中的题数，文件太大会部署失败
+    if len(frame) > 500:
+        frame = frame.head(500)
+    H = frame.shape[0]
+
     for i in range(H):
         problem = "|"
         for j in range(W):

src/.vuepress/sidebar.ts

@@ -720,6 +720,7 @@ export default sidebar({
       "1351",
       "1352",
       "1356",
+      "1358",
       "1360",
       "1365",
       "1370",
@@ -1099,6 +1100,7 @@ export default sidebar({
       "2501",
       "2516",
       "2523",
+      "2529",
       "2530",
       "2542",
       "2554",
@@ -1268,6 +1270,7 @@ export default sidebar({
     "collapsible": true,
     "children": [
       "3203",
+      "3208",
       "3223",
       "3243",
       "3264"
@@ -1277,10 +1280,12 @@ export default sidebar({
     "text": "3300-3399",
     "collapsible": true,
     "children": [
+      "3306",
       "3309",
       "3318",
       "3319",
-      "3321"
+      "3321",
+      "3356"
     ]
   }
 

src/book/slide_window.md

@@ -589,7 +589,7 @@ var lengthOfLongestSubstring = function (s) {
 | 992 | K 个不同整数的子数组 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/subarrays-with-k-different-integers) [🔗](https://leetcode.com/problems/subarrays-with-k-different-integers) |
 | 713 | 乘积小于 K 的子数组 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/subarray-product-less-than-k) [🔗](https://leetcode.com/problems/subarray-product-less-than-k) |
 | 904 | 水果成篮 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/fruit-into-baskets) [🔗](https://leetcode.com/problems/fruit-into-baskets) |
-| 1358 | 包含所有三种字符的子字符串数目 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |
+| 1358 | 包含所有三种字符的子字符串数目 | [[✓]](/problem/1358.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |
 | 467 | 环绕字符串中唯一的子字符串 | [[✓]](/problem/0467.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/unique-substrings-in-wraparound-string) [🔗](https://leetcode.com/problems/unique-substrings-in-wraparound-string) |
 | 1438 | 绝对差不超过限制的最长连续子数组 |  |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`有序集合`](/tag/ordered-set.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) [🔗](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
 

src/plan/contest_list.md

@@ -61,7 +61,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 3304 | 找出第 K 个字符 I |  |  [`位运算`](/tag/bit-manipulation.md) [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/find-the-k-th-character-in-string-game-i) [🔗](https://leetcode.com/problems/find-the-k-th-character-in-string-game-i) |
 | 3305 | 元音辅音字符串计数 I |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i) [🔗](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i) |
-| 3306 | 元音辅音字符串计数 II |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) [🔗](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
+| 3306 | 元音辅音字符串计数 II | [[✓]](/problem/3306.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) [🔗](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
 | 3307 | 找出第 K 个字符 II |  |  [`位运算`](/tag/bit-manipulation.md) [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-k-th-character-in-string-game-ii) [🔗](https://leetcode.com/problems/find-the-k-th-character-in-string-game-ii) |
 
 
@@ -289,7 +289,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 3206 | 交替组 I |  |  [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟢 | [🀄️](https://leetcode.cn/problems/alternating-groups-i) [🔗](https://leetcode.com/problems/alternating-groups-i) |
 | 3207 | 与敌人战斗后的最大分数 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-points-after-enemy-battles) [🔗](https://leetcode.com/problems/maximum-points-after-enemy-battles) |
-| 3208 | 交替组 II |  |  [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/alternating-groups-ii) [🔗](https://leetcode.com/problems/alternating-groups-ii) |
+| 3208 | 交替组 II | [[✓]](/problem/3208.md) |  [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/alternating-groups-ii) [🔗](https://leetcode.com/problems/alternating-groups-ii) |
 | 3209 | 子数组按位与值为 K 的数目 |  |  [`位运算`](/tag/bit-manipulation.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-subarrays-with-and-value-of-k) [🔗](https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k) |
 
 
@@ -1679,7 +1679,7 @@ headerDepth: 0
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 2529 | 正整数和负整数的最大计数 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |
+| 2529 | 正整数和负整数的最大计数 | [[✓]](/problem/2529.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |
 | 2530 | 执行 K 次操作后的最大分数 | [[✓]](/problem/2530.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`堆（优先队列）`](/tag/heap-priority-queue.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximal-score-after-applying-k-operations) [🔗](https://leetcode.com/problems/maximal-score-after-applying-k-operations) |
 | 2531 | 使字符串中不同字符的数目相等 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/make-number-of-distinct-characters-equal) [🔗](https://leetcode.com/problems/make-number-of-distinct-characters-equal) |
 | 2532 | 过桥的时间 |  |  [`数组`](/tag/array.md) [`模拟`](/tag/simulation.md) [`堆（优先队列）`](/tag/heap-priority-queue.md) | 🔴 | [🀄️](https://leetcode.cn/problems/time-to-cross-a-bridge) [🔗](https://leetcode.com/problems/time-to-cross-a-bridge) |
@@ -4393,7 +4393,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 1356 | 根据数字二进制下 1 的数目排序 | [[✓]](/problem/1356.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`计数`](/tag/counting.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/sort-integers-by-the-number-of-1-bits) [🔗](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits) |
 | 1357 | 每隔 n 个顾客打折 |  |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/apply-discount-every-n-orders) [🔗](https://leetcode.com/problems/apply-discount-every-n-orders) |
-| 1358 | 包含所有三种字符的子字符串数目 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |
+| 1358 | 包含所有三种字符的子字符串数目 | [[✓]](/problem/1358.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |
 | 1359 | 有效的快递序列数目 |  |  [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) [`组合数学`](/tag/combinatorics.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-all-valid-pickup-and-delivery-options) [🔗](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options) |
 
 

src/problem/0121.md

@@ -79,15 +79,15 @@ cannot achieve any profit, return `0`.
 
 ### 思路一：动态规划
 
-1. **动态规划：**定义一个二维数组 `dp`，其中 `dp[i][0]` 表示第 `i` 天不持有股票时的最大利润， `dp[i][1]` 表示第 `i` 天持有股票时的最大利润。
+1. **动态规划：** 定义一个二维数组 `dp`，其中 `dp[i][0]` 表示第 `i` 天不持有股票时的最大利润， `dp[i][1]` 表示第 `i` 天持有股票时的最大利润。
 2. **状态转移方程：**
 
    - `dp[i][0] = max(dp[i-1][0], dp[i-1][1] + prices[i])`，表示在第 `i` 天，不持有股票的最大利润等于前一天不持有股票的最大利润，或者前一天持有股票的最大利润加上今天卖出的利润的最大值。
    - `dp[i][1] = max(dp[i-1][1], -prices[i])`，表示在第 `i` 天，持有股票的最大利润等于前一天持有股票的最大利润，或者前一天不持有股票的最大利润减去今天买入的利润的最大值。由于题目规定只能买入一次，所以前一天不持有股票的最大利润为 0。
 
-3. **边界条件：**第一天（`i == 0`）时，`dp[0][0] = 0`，`dp[0][1] = -prices[0]`。
-4. **初始化：**初始化利润为 0。
-5. **返回最大利润：**最后返回 `dp[n - 1][0]`，即最后一天不持有股票的最大利润，因为若最后一天还持有股票没有卖出，收益肯定小于做了一次交易的情况。
+3. **边界条件：** 第一天（`i == 0`）时，`dp[0][0] = 0`，`dp[0][1] = -prices[0]`。
+4. **初始化：** 初始化利润为 0。
+5. **返回最大利润：** 最后返回 `dp[n - 1][0]`，即最后一天不持有股票的最大利润，因为若最后一天还持有股票没有卖出，收益肯定小于做了一次交易的情况。
 
 #### 复杂度分析
 

src/problem/0494.md

@@ -225,19 +225,15 @@ var findTargetSumWays = function (nums, target) {
 	const sum = nums.reduce((num, acc) => num + acc, 0);
 	if (sum < target || -sum > target || (sum + target) % 2 == 1) return 0;
 
-	const subset = (nums, sum) => {
-		const dp = new Array(sum + 1).fill(0);
-		dp[0] = 1;
-		for (let num of nums) {
-			for (let j = sum; j >= 0; j--) {
-				if (j >= num) {
-					dp[j] = dp[j - num] + dp[j];
-				}
-			}
+	const n = (sum + target) / 2;
+	const dp = new Array(n + 1).fill(0);
+	dp[0] = 1;
+	for (let num of nums) {
+		for (let i = n; i >= num; i--) {
+			dp[i] += dp[i - num];
 		}
-		return dp[sum];
-	};
-	return subset(nums, (sum + target) / 2);
+	}
+	return dp[n];
 };
 ```
 

src/problem/0704.md

@@ -100,4 +100,4 @@ var search = function (nums, target) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 702 | 搜索长度未知的有序数组 🔒 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`交互`](/tag/interactive.md) | 🟠 | [🀄️](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size) [🔗](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) |
-| 2529 | 正整数和负整数的最大计数 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |
+| 2529 | 正整数和负整数的最大计数 | [[✓]](/problem/2529.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |

src/problem/1351.md

@@ -166,4 +166,4 @@ var countNegatives = function (grid) {
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 2529 | 正整数和负整数的最大计数 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |
+| 2529 | 正整数和负整数的最大计数 | [[✓]](/problem/2529.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |