Deploying to main from @ 5f8b364 🚀

Author: 2xiao

book/dynamic_programming.md

@@ -310,7 +310,7 @@
 | 248 | 中心对称数 III 🔒 |  |  [`递归`](/tag/recursion.md) [`数组`](/tag/array.md) [`字符串`](/tag/string.md) | 🔴 | [🀄️](https://leetcode.cn/problems/strobogrammatic-number-iii) [🔗](https://leetcode.com/problems/strobogrammatic-number-iii) |
 | 1088 | 易混淆数 II 🔒 |  |  [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🔴 | [🀄️](https://leetcode.cn/problems/confusing-number-ii) [🔗](https://leetcode.com/problems/confusing-number-ii) |
 | 1067 | 范围内的数字计数 🔒 |  |  [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/digit-count-in-range) [🔗](https://leetcode.com/problems/digit-count-in-range) |
-| 1742 | 盒子中小球的最大数量 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box) [🔗](https://leetcode.com/problems/maximum-number-of-balls-in-a-box) |
+| 1742 | 盒子中小球的最大数量 | [[✓]](/problem/1742.md) |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-number-of-balls-in-a-box) [🔗](https://leetcode.com/problems/maximum-number-of-balls-in-a-box) |
 | 面试题 17.06 | 2出现的次数 |  |  [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-2s-in-range-lcci) |
 
 #### 概率 DP

book/greedy.md

@@ -32,7 +32,7 @@
 | 392 | 判断子序列 | [[✓]](/problem/0392.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/is-subsequence) [🔗](https://leetcode.com/problems/is-subsequence) |
 | 122 | 买卖股票的最佳时机 II | [[✓]](/problem/0122.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) |
 | 561 | 数组拆分 | [[✓]](/problem/0561.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
-| 1710 | 卡车上的最大单元数 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-units-on-a-truck) [🔗](https://leetcode.com/problems/maximum-units-on-a-truck) |
+| 1710 | 卡车上的最大单元数 | [[✓]](/problem/1710.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-units-on-a-truck) [🔗](https://leetcode.com/problems/maximum-units-on-a-truck) |
 | 1217 | 玩筹码 | [[✓]](/problem/1217.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position) [🔗](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) |
 | 1247 | 交换字符使得字符串相同 |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal) |
 | 1400 | 构造 K 个回文字符串 |  |  [`贪心`](/tag/greedy.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/construct-k-palindrome-strings) [🔗](https://leetcode.com/problems/construct-k-palindrome-strings) |

book/string.md

@@ -95,7 +95,7 @@ BF 算法的思想可以用一句话来概括：在主串中检查起始位置
 | 28 | 找出字符串中第一个匹配项的下标 | [[✓]](/problem/0028.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string) [🔗](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string) |
 | 459 | 重复的子字符串 | [[✓]](/problem/0459.md) |  [`字符串`](/tag/string.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/repeated-substring-pattern) [🔗](https://leetcode.com/problems/repeated-substring-pattern) |
 | 686 | 重复叠加字符串匹配 |  |  [`字符串`](/tag/string.md) [`字符串匹配`](/tag/string-matching.md) | 🟠 | [🀄️](https://leetcode.cn/problems/repeated-string-match) [🔗](https://leetcode.com/problems/repeated-string-match) |
-| 1668 | 最大重复子字符串 |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-repeating-substring) [🔗](https://leetcode.com/problems/maximum-repeating-substring) |
+| 1668 | 最大重复子字符串 | [[✓]](/problem/1668.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-repeating-substring) [🔗](https://leetcode.com/problems/maximum-repeating-substring) |
 | 796 | 旋转字符串 | [[✓]](/problem/0796.md) |  [`字符串`](/tag/string.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/rotate-string) [🔗](https://leetcode.com/problems/rotate-string) |
 | 1408 | 数组中的字符串匹配 | [[✓]](/problem/1408.md) |  [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`字符串匹配`](/tag/string-matching.md) | 🟢 | [🀄️](https://leetcode.cn/problems/string-matching-in-an-array) [🔗](https://leetcode.com/problems/string-matching-in-an-array) |
 | 2156 | 查找给定哈希值的子串 |  |  [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) [`哈希函数`](/tag/hash-function.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-substring-with-given-hash-value) [🔗](https://leetcode.com/problems/find-substring-with-given-hash-value) |