Deploying to main from @ 9c975ba 🚀

Author: 2xiao

book/dynamic_programming.md

@@ -59,7 +59,7 @@
 | 403 | 青蛙过河 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/frog-jump) [🔗](https://leetcode.com/problems/frog-jump) |
 | 552 | 学生出勤记录 II |  |  [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/student-attendance-record-ii) [🔗](https://leetcode.com/problems/student-attendance-record-ii) |
 | 913 | 猫和老鼠 |  |  [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) [`记忆化搜索`](/tag/memoization.md) `3+` | 🔴 | [🀄️](https://leetcode.cn/problems/cat-and-mouse) [🔗](https://leetcode.com/problems/cat-and-mouse) |
-| 329 | 矩阵中的最长递增路径 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) |
+| 329 | 矩阵中的最长递增路径 | [[✓]](/problem/0329.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) |
 
 #### 线性 DP
 
@@ -78,7 +78,7 @@
 | 213 | 打家劫舍 II | [[✓]](/problem/0213.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-ii) [🔗](https://leetcode.com/problems/house-robber-ii) |
 | 740 | 删除并获得点数 | [[✓]](/problem/0740.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/delete-and-earn) [🔗](https://leetcode.com/problems/delete-and-earn) |
 | 1388 | 3n 块披萨 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/pizza-with-3n-slices) [🔗](https://leetcode.com/problems/pizza-with-3n-slices) |
-| 873 | 最长的斐波那契子序列的长度 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence) [🔗](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) |
+| 873 | 最长的斐波那契子序列的长度 | [[✓]](/problem/0873.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence) [🔗](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) |
 | 1027 | 最长等差数列 | [[✓]](/problem/1027.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/longest-arithmetic-subsequence) [🔗](https://leetcode.com/problems/longest-arithmetic-subsequence) |
 | 1055 | 形成字符串的最短路径 🔒 |  |  [`贪心`](/tag/greedy.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/shortest-way-to-form-string) [🔗](https://leetcode.com/problems/shortest-way-to-form-string) |
 | 368 | 最大整除子集 | [[✓]](/problem/0368.md) |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/largest-divisible-subset) [🔗](https://leetcode.com/problems/largest-divisible-subset) |
@@ -177,7 +177,7 @@
 | 518 | 零钱兑换 II | [[✓]](/problem/0518.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/coin-change-ii) [🔗](https://leetcode.com/problems/coin-change-ii) |
 | 139 | 单词拆分 | [[✓]](/problem/0139.md) |  [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/word-break) [🔗](https://leetcode.com/problems/word-break) |
 | 377 | 组合总和 Ⅳ | [[✓]](/problem/0377.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/combination-sum-iv) [🔗](https://leetcode.com/problems/combination-sum-iv) |
-| 638 | 大礼包 |  |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
+| 638 | 大礼包 | [[✓]](/problem/0638.md) |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
 | 1449 | 数位成本和为目标值的最大数字 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target) [🔗](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target) |
 
 * 多重背包问题
@@ -268,9 +268,9 @@
 | 1681 | 最小不兼容性 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-incompatibility) [🔗](https://leetcode.com/problems/minimum-incompatibility) |
 | 526 | 优美的排列 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/beautiful-arrangement) [🔗](https://leetcode.com/problems/beautiful-arrangement) |
 | 351 | 安卓系统手势解锁 🔒 |  |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) [`回溯`](/tag/backtracking.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/android-unlock-patterns) [🔗](https://leetcode.com/problems/android-unlock-patterns) |
-| 464 | 我能赢吗 |  |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数学`](/tag/math.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/can-i-win) [🔗](https://leetcode.com/problems/can-i-win) |
+| 464 | 我能赢吗 | [[✓]](/problem/0464.md) |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数学`](/tag/math.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/can-i-win) [🔗](https://leetcode.com/problems/can-i-win) |
 | 847 | 访问所有节点的最短路径 |  |  [`位运算`](/tag/bit-manipulation.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-path-visiting-all-nodes) [🔗](https://leetcode.com/problems/shortest-path-visiting-all-nodes) |
-| 638 | 大礼包 |  |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
+| 638 | 大礼包 | [[✓]](/problem/0638.md) |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
 | 1994 | 好子集的数目 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/the-number-of-good-subsets) [🔗](https://leetcode.com/problems/the-number-of-good-subsets) |
 | 1349 | 参加考试的最大学生数 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-students-taking-exam) [🔗](https://leetcode.com/problems/maximum-students-taking-exam) |
 | 698 | 划分为k个相等的子集 |  |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets) [🔗](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) |

book/slide_window.md

@@ -590,6 +590,6 @@ var lengthOfLongestSubstring = function (s) {
 | 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) |
-| 467 | 环绕字符串中唯一的子字符串 |  |  [`字符串`](/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) |
+| 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) |
 

plan/codetop_list.md

@@ -159,7 +159,7 @@ headerDepth: 0
 | 384 | 打乱数组 | [[✓]](/problem/0384.md) |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`随机化`](/tag/randomized.md) | 🟠 | [🀄️](https://leetcode.cn/problems/shuffle-an-array) [🔗](https://leetcode.com/problems/shuffle-an-array) | 28 |
 | 328 | 奇偶链表 | [[✓]](/problem/0328.md) |  [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/odd-even-linked-list) [🔗](https://leetcode.com/problems/odd-even-linked-list) | 28 |
 | 91 | 解码方法 | [[✓]](/problem/0091.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/decode-ways) [🔗](https://leetcode.com/problems/decode-ways) | 28 |
-| 329 | 矩阵中的最长递增路径 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 28 |
+| 329 | 矩阵中的最长递增路径 | [[✓]](/problem/0329.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 28 |
 | 208 | 实现 Trie (前缀树) | [[✓]](/problem/0208.md) |  [`设计`](/tag/design.md) [`字典树`](/tag/trie.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/implement-trie-prefix-tree) [🔗](https://leetcode.com/problems/implement-trie-prefix-tree) | 27 |
 | 9 | 回文数 | [[✓]](/problem/0009.md) |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/palindrome-number) [🔗](https://leetcode.com/problems/palindrome-number) | 27 |
 | 10 | 正则表达式匹配 | [[✓]](/problem/0010.md) |  [`递归`](/tag/recursion.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/regular-expression-matching) [🔗](https://leetcode.com/problems/regular-expression-matching) | 26 |

plan/company_list.md

@@ -69,7 +69,7 @@ headerDepth: 0
 | 29 | 两数相除 | [[✓]](/problem/0029.md) |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/divide-two-integers) [🔗](https://leetcode.com/problems/divide-two-integers) | 18 |
 | 636 | 函数的独占时间 |  |  [`栈`](/tag/stack.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/exclusive-time-of-functions) [🔗](https://leetcode.com/problems/exclusive-time-of-functions) | 18 |
 | 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) | 17 |
-| 329 | 矩阵中的最长递增路径 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 16 |
+| 329 | 矩阵中的最长递增路径 | [[✓]](/problem/0329.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 16 |
 | 157 | 用 Read4 读取 N 个字符 🔒 |  |  [`数组`](/tag/array.md) [`交互`](/tag/interactive.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/read-n-characters-given-read4) [🔗](https://leetcode.com/problems/read-n-characters-given-read4) | 16 |
 | 523 | 连续的子数组和 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/continuous-subarray-sum) [🔗](https://leetcode.com/problems/continuous-subarray-sum) | 16 |
 | 65 | 有效数字 |  |  [`字符串`](/tag/string.md) | 🔴 | [🀄️](https://leetcode.cn/problems/valid-number) [🔗](https://leetcode.com/problems/valid-number) | 15 |