Deploying to main from @ d8230d7 🚀

Author: 2xiao

plan/contest_list.md

@@ -1514,7 +1514,7 @@ headerDepth: 0
 | 2591 | 将钱分给最多的儿童 |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/distribute-money-to-maximum-children) [🔗](https://leetcode.com/problems/distribute-money-to-maximum-children) |
 | 2592 | 最大化数组的伟大值 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximize-greatness-of-an-array) [🔗](https://leetcode.com/problems/maximize-greatness-of-an-array) |
 | 2593 | 标记所有元素后数组的分数 | [[✓]](/problem/2593.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-score-of-an-array-after-marking-all-elements) [🔗](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements) |
-| 2594 | 修车的最少时间 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-time-to-repair-cars) [🔗](https://leetcode.com/problems/minimum-time-to-repair-cars) |
+| 2594 | 修车的最少时间 | [[✓]](/problem/2594.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-time-to-repair-cars) [🔗](https://leetcode.com/problems/minimum-time-to-repair-cars) |
 
 
 ## Weekly Contest 336 (2023-03-12 10:30)
@@ -1609,7 +1609,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2558 | 从数量最多的堆取走礼物 | [[✓]](/problem/2558.md) |  [`数组`](/tag/array.md) [`模拟`](/tag/simulation.md) [`堆（优先队列）`](/tag/heap-priority-queue.md) | 🟢 | [🀄️](https://leetcode.cn/problems/take-gifts-from-the-richest-pile) [🔗](https://leetcode.com/problems/take-gifts-from-the-richest-pile) |
 | 2559 | 统计范围内的元音字符串数 | [[✓]](/problem/2559.md) |  [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-vowel-strings-in-ranges) [🔗](https://leetcode.com/problems/count-vowel-strings-in-ranges) |
-| 2560 | 打家劫舍 IV |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
+| 2560 | 打家劫舍 IV | [[✓]](/problem/2560.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
 | 2561 | 重排水果 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🔴 | [🀄️](https://leetcode.cn/problems/rearranging-fruits) [🔗](https://leetcode.com/problems/rearranging-fruits) |
 
 
@@ -1728,7 +1728,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2511 | 最多可以摧毁的敌人城堡数目 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-enemy-forts-that-can-be-captured) [🔗](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured) |
-| 2512 | 奖励最顶尖的 K 名学生 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/reward-top-k-students) [🔗](https://leetcode.com/problems/reward-top-k-students) |
+| 2512 | 奖励最顶尖的 K 名学生 | [[✓]](/problem/2512.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/reward-top-k-students) [🔗](https://leetcode.com/problems/reward-top-k-students) |
 | 2513 | 最小化两个数组中的最大值 |  |  [`数学`](/tag/math.md) [`二分查找`](/tag/binary-search.md) [`数论`](/tag/number-theory.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimize-the-maximum-of-two-arrays) [🔗](https://leetcode.com/problems/minimize-the-maximum-of-two-arrays) |
 | 2514 | 统计同位异构字符串数目 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-anagrams) [🔗](https://leetcode.com/problems/count-anagrams) |
 
@@ -2005,7 +2005,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2399 | 检查相同字母间的距离 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-distances-between-same-letters) [🔗](https://leetcode.com/problems/check-distances-between-same-letters) |
 | 2400 | 恰好移动 k 步到达某一位置的方法数目 |  |  [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) [`组合数学`](/tag/combinatorics.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps) [🔗](https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps) |
-| 2401 | 最长优雅子数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
+| 2401 | 最长优雅子数组 | [[✓]](/problem/2401.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
 | 2402 | 会议室 III |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/meeting-rooms-iii) [🔗](https://leetcode.com/problems/meeting-rooms-iii) |
 
 
@@ -2401,7 +2401,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2224 | 转化时间需要的最少操作数 | [[✓]](/problem/2224.md) |  [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-number-of-operations-to-convert-time) [🔗](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time) |
 | 2225 | 找出输掉零场或一场比赛的玩家 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-players-with-zero-or-one-losses) [🔗](https://leetcode.com/problems/find-players-with-zero-or-one-losses) |
-| 2226 | 每个小孩最多能分到多少糖果 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-candies-allocated-to-k-children) [🔗](https://leetcode.com/problems/maximum-candies-allocated-to-k-children) |
+| 2226 | 每个小孩最多能分到多少糖果 | [[✓]](/problem/2226.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-candies-allocated-to-k-children) [🔗](https://leetcode.com/problems/maximum-candies-allocated-to-k-children) |
 | 2227 | 加密解密字符串 |  |  [`设计`](/tag/design.md) [`字典树`](/tag/trie.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/encrypt-and-decrypt-strings) [🔗](https://leetcode.com/problems/encrypt-and-decrypt-strings) |
 
 

problem/0003.md

@@ -168,7 +168,7 @@ var lengthOfLongestSubstring = function (s) {
 | 1695 | 删除子数组的最大得分 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-erasure-value) [🔗](https://leetcode.com/problems/maximum-erasure-value) |
 | 2067 | 等计数子串的数量 🔒 |  |  [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-equal-count-substrings) [🔗](https://leetcode.com/problems/number-of-equal-count-substrings) |
 | 2260 | 必须拿起的最小连续卡牌数 | [[✓]](/problem/2260.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-consecutive-cards-to-pick-up) [🔗](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up) |
-| 2401 | 最长优雅子数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
+| 2401 | 最长优雅子数组 | [[✓]](/problem/2401.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
 | 2405 | 子字符串的最优划分 | [[✓]](/problem/2405.md) |  [`贪心`](/tag/greedy.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/optimal-partition-of-string) [🔗](https://leetcode.com/problems/optimal-partition-of-string) |
 | 2799 | 统计完全子数组的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-complete-subarrays-in-an-array) [🔗](https://leetcode.com/problems/count-complete-subarrays-in-an-array) |
 | 2981 | 找出出现至少三次的最长特殊子字符串 I |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-longest-special-substring-that-occurs-thrice-i) [🔗](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i) |

problem/0011.md

@@ -115,4 +115,4 @@ var maxArea = function (height) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 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) |
 | 2517 | 礼盒的最大甜蜜度 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-tastiness-of-candy-basket) [🔗](https://leetcode.com/problems/maximum-tastiness-of-candy-basket) |
-| 2560 | 打家劫舍 IV |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
+| 2560 | 打家劫舍 IV | [[✓]](/problem/2560.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |

problem/0198.md

@@ -167,6 +167,6 @@ var rob = function (nums) {
 | 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) |
 | 2140 | 解决智力问题 | [[✓]](/problem/2140.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/solving-questions-with-brainpower) [🔗](https://leetcode.com/problems/solving-questions-with-brainpower) |
 | 2320 | 统计放置房子的方式数 |  |  [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-ways-to-place-houses) [🔗](https://leetcode.com/problems/count-number-of-ways-to-place-houses) |
-| 2560 | 打家劫舍 IV |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
+| 2560 | 打家劫舍 IV | [[✓]](/problem/2560.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
 | 2611 | 老鼠和奶酪 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/mice-and-cheese) [🔗](https://leetcode.com/problems/mice-and-cheese) |
 | 2789 | 合并后数组中的最大元素 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/largest-element-in-an-array-after-merge-operations) [🔗](https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations) |

problem/0201.md

@@ -98,4 +98,4 @@ var rangeBitwiseAnd = function (left, right) {
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 2401 | 最长优雅子数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
+| 2401 | 最长优雅子数组 | [[✓]](/problem/2401.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |

problem/0406.md

@@ -154,4 +154,4 @@ var reconstructQueue = function (people) {
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 315 | 计算右侧小于当前元素的个数 |  |  [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-of-smaller-numbers-after-self) [🔗](https://leetcode.com/problems/count-of-smaller-numbers-after-self) |
-| 2512 | 奖励最顶尖的 K 名学生 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/reward-top-k-students) [🔗](https://leetcode.com/problems/reward-top-k-students) |
+| 2512 | 奖励最顶尖的 K 名学生 | [[✓]](/problem/2512.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/reward-top-k-students) [🔗](https://leetcode.com/problems/reward-top-k-students) |

problem/0875.md

@@ -163,6 +163,6 @@ var minEatingSpeed = function (piles, h) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 774 | 最小化去加油站的最大距离 🔒 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimize-max-distance-to-gas-station) [🔗](https://leetcode.com/problems/minimize-max-distance-to-gas-station) |
 | 2064 | 分配给商店的最多商品的最小值 | [[✓]](/problem/2064.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimized-maximum-of-products-distributed-to-any-store) [🔗](https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store) |
-| 2226 | 每个小孩最多能分到多少糖果 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-candies-allocated-to-k-children) [🔗](https://leetcode.com/problems/maximum-candies-allocated-to-k-children) |
+| 2226 | 每个小孩最多能分到多少糖果 | [[✓]](/problem/2226.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-candies-allocated-to-k-children) [🔗](https://leetcode.com/problems/maximum-candies-allocated-to-k-children) |
 | 2498 | 青蛙过河 II |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/frog-jump-ii) [🔗](https://leetcode.com/problems/frog-jump-ii) |
-| 2594 | 修车的最少时间 |  |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-time-to-repair-cars) [🔗](https://leetcode.com/problems/minimum-time-to-repair-cars) |
+| 2594 | 修车的最少时间 | [[✓]](/problem/2594.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-time-to-repair-cars) [🔗](https://leetcode.com/problems/minimum-time-to-repair-cars) |

problem/1004.md

@@ -139,6 +139,6 @@ var longestOnes = function (nums, k) {
 | 1493 | 删掉一个元素以后全为 1 的最长子数组 | [[✓]](/problem/1493.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-subarray-of-1s-after-deleting-one-element) [🔗](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element) |
 | 2024 | 考试的最大困扰度 |  |  [`字符串`](/tag/string.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximize-the-confusion-of-an-exam) [🔗](https://leetcode.com/problems/maximize-the-confusion-of-an-exam) |
 | 2379 | 得到 K 个黑块的最少涂色次数 | [[✓]](/problem/2379.md) |  [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-recolors-to-get-k-consecutive-black-blocks) [🔗](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks) |
-| 2401 | 最长优雅子数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
+| 2401 | 最长优雅子数组 | [[✓]](/problem/2401.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-nice-subarray) [🔗](https://leetcode.com/problems/longest-nice-subarray) |
 | 2461 | 长度为 K 子数组中的最大和 | [[✓]](/problem/2461.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-sum-of-distinct-subarrays-with-length-k) [🔗](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k) |
 | 2511 | 最多可以摧毁的敌人城堡数目 |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-enemy-forts-that-can-be-captured) [🔗](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured) |