Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit d8230d7

Browse files
committed
add 5 solutions
1 parent d8ea13e commit d8230d7

24 files changed

+1028
-30
lines changed

‎src/.vuepress/sidebar.ts

Lines changed: 6 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1011,6 +1011,7 @@ export default sidebar({
10111011
"2215",
10121012
"2220",
10131013
"2224",
1014+
"2226",
10141015
"2231",
10151016
"2235",
10161017
"2236",
@@ -1072,6 +1073,7 @@ export default sidebar({
10721073
"text": "2400-2499",
10731074
"collapsible": true,
10741075
"children": [
1076+
"2401",
10751077
"2405",
10761078
"2406",
10771079
"2410",
@@ -1098,6 +1100,7 @@ export default sidebar({
10981100
"collapsible": true,
10991101
"children": [
11001102
"2501",
1103+
"2512",
11011104
"2516",
11021105
"2523",
11031106
"2529",
@@ -1106,12 +1109,14 @@ export default sidebar({
11061109
"2554",
11071110
"2558",
11081111
"2559",
1112+
"2560",
11091113
"2563",
11101114
"2570",
11111115
"2577",
11121116
"2579",
11131117
"2583",
1114-
"2593"
1118+
"2593",
1119+
"2594"
11151120
]
11161121
},
11171122
{

‎src/plan/contest_list.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1514,7 +1514,7 @@ headerDepth: 0
15141514
| 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) |
15151515
| 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) |
15161516
| 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) |
1517-
| 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) |
1517+
| 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) |
15181518

15191519

15201520
## Weekly Contest 336 (2023年03月12日 10:30)
@@ -1609,7 +1609,7 @@ headerDepth: 0
16091609
| :------: | :------ | :------: | :------ | :------: | :------: |
16101610
| 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) |
16111611
| 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) |
1612-
| 2560 | 打家劫舍 IV | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
1612+
| 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) |
16131613
| 2561 | 重排水果 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🔴 | [🀄️](https://leetcode.cn/problems/rearranging-fruits) [🔗](https://leetcode.com/problems/rearranging-fruits) |
16141614

16151615

@@ -1728,7 +1728,7 @@ headerDepth: 0
17281728
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
17291729
| :------: | :------ | :------: | :------ | :------: | :------: |
17301730
| 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) |
1731-
| 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) |
1731+
| 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) |
17321732
| 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) |
17331733
| 2514 | 统计同位异构字符串数目 | | [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-anagrams) [🔗](https://leetcode.com/problems/count-anagrams) |
17341734

@@ -2005,7 +2005,7 @@ headerDepth: 0
20052005
| :------: | :------ | :------: | :------ | :------: | :------: |
20062006
| 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) |
20072007
| 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) |
2008-
| 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) |
2008+
| 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) |
20092009
| 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) |
20102010

20112011

@@ -2401,7 +2401,7 @@ headerDepth: 0
24012401
| :------: | :------ | :------: | :------ | :------: | :------: |
24022402
| 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) |
24032403
| 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) |
2404-
| 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) |
2404+
| 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) |
24052405
| 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) |
24062406

24072407

‎src/problem/0003.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -168,7 +168,7 @@ var lengthOfLongestSubstring = function (s) {
168168
| 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) |
169169
| 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) |
170170
| 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) |
171-
| 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) |
171+
| 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) |
172172
| 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) |
173173
| 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) |
174174
| 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) |

‎src/problem/0011.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -115,4 +115,4 @@ var maxArea = function (height) {
115115
| :------: | :------ | :------: | :------ | :------: | :------: |
116116
| 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) |
117117
| 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) |
118-
| 2560 | 打家劫舍 IV | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
118+
| 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) |

‎src/problem/0198.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -167,6 +167,6 @@ var rob = function (nums) {
167167
| 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) |
168168
| 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) |
169169
| 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) |
170-
| 2560 | 打家劫舍 IV | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-iv) [🔗](https://leetcode.com/problems/house-robber-iv) |
170+
| 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) |
171171
| 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) |
172172
| 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) |

‎src/problem/0201.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -98,4 +98,4 @@ var rangeBitwiseAnd = function (left, right) {
9898
<!-- prettier-ignore -->
9999
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
100100
| :------: | :------ | :------: | :------ | :------: | :------: |
101-
| 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) |
101+
| 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) |

‎src/problem/0406.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -154,4 +154,4 @@ var reconstructQueue = function (people) {
154154
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
155155
| :------: | :------ | :------: | :------ | :------: | :------: |
156156
| 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) |
157-
| 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) |
157+
| 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) |

‎src/problem/0875.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -163,6 +163,6 @@ var minEatingSpeed = function (piles, h) {
163163
| :------: | :------ | :------: | :------ | :------: | :------: |
164164
| 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) |
165165
| 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) |
166-
| 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) |
166+
| 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) |
167167
| 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) |
168-
| 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) |
168+
| 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) |

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /