Skip to content

Commit e7ced26

Browse files
yanglbmeyanglbme
authored
chore: update lc problems (#4319)
1 parent 2dcc707 commit e7ced26

File tree

31 files changed

+131
-57
lines changed

31 files changed

+131
-57
lines changed

‎solution/3400-3499/3482.Analyze Organization Hierarchy/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -135,7 +135,7 @@ employee_id 是这张表的唯一主键。
135135

136136
<ul>
137137
<li>结果先以层级升序排序</li>
138-
<li>在同一层级内，员工按预算降序排序，然后按姓名降序排序</li>
138+
<li>在同一层级内，员工按预算降序排序，然后按姓名升序排序</li>
139139
</ul>
140140
</div>
141141

‎solution/3400-3499/3496.Maximize Score After Pair Deletions/README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3496.Maximize%20Score%20After%20Pair%20Deletions/README.md
5+
tags:
6+
- 贪心
7+
- 数组
58
---
69

710
<!-- problem:start -->

‎solution/3400-3499/3496.Maximize Score After Pair Deletions/README_EN.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3496.Maximize%20Score%20After%20Pair%20Deletions/README_EN.md
5+
tags:
6+
- Greedy
7+
- Array
58
---
69

710
<!-- problem:start -->

‎solution/3400-3499/3498.Reverse Degree of a String/README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3498.Reverse%20Degree%20of%20a%20String/README.md
5+
tags:
6+
- 字符串
7+
- 模拟
58
---
69

710
<!-- problem:start -->

‎solution/3400-3499/3498.Reverse Degree of a String/README_EN.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3498.Reverse%20Degree%20of%20a%20String/README_EN.md
5+
tags:
6+
- String
7+
- Simulation
58
---
69

710
<!-- problem:start -->

‎solution/3400-3499/3499.Maximize Active Section with Trade I/README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3499.Maximize%20Active%20Section%20with%20Trade%20I/README.md
5+
tags:
6+
- 字符串
7+
- 枚举
58
---
69

710
<!-- problem:start -->

‎solution/3400-3499/3499.Maximize Active Section with Trade I/README_EN.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,9 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3499.Maximize%20Active%20Section%20with%20Trade%20I/README_EN.md
5+
tags:
6+
- String
7+
- Enumeration
58
---
69

710
<!-- problem:start -->

‎solution/3500-3599/3500.Minimum Cost to Divide Array Into Subarrays/README.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3500.Minimum%20Cost%20to%20Divide%20Array%20Into%20Subarrays/README.md
5+
tags:
6+
- 数组
7+
- 动态规划
8+
- 前缀和
59
---
610

711
<!-- problem:start -->

‎solution/3500-3599/3500.Minimum Cost to Divide Array Into Subarrays/README_EN.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3500.Minimum%20Cost%20to%20Divide%20Array%20Into%20Subarrays/README_EN.md
5+
tags:
6+
- Array
7+
- Dynamic Programming
8+
- Prefix Sum
59
---
610

711
<!-- problem:start -->

‎solution/3500-3599/3501.Maximize Active Section with Trade II/README.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3501.Maximize%20Active%20Section%20with%20Trade%20II/README.md
5+
tags:
6+
- 线段树
7+
- 数组
8+
- 字符串
9+
- 二分查找
510
---
611

712
<!-- problem:start -->

‎solution/3500-3599/3501.Maximize Active Section with Trade II/README_EN.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3501.Maximize%20Active%20Section%20with%20Trade%20II/README_EN.md
5+
tags:
6+
- Segment Tree
7+
- Array
8+
- String
9+
- Binary Search
510
---
611

712
<!-- problem:start -->

‎solution/3500-3599/3502.Minimum Cost to Reach Every Position/README.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README.md
5+
tags:
6+
- 数组
57
---
68

79
<!-- problem:start -->

‎solution/3500-3599/3502.Minimum Cost to Reach Every Position/README_EN.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README_EN.md
5+
tags:
6+
- Array
57
---
68

79
<!-- problem:start -->

‎solution/3500-3599/3503.Longest Palindrome After Substring Concatenation I/README.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README.md
5+
tags:
6+
- 双指针
7+
- 字符串
8+
- 动态规划
9+
- 枚举
510
---
611

712
<!-- problem:start -->

‎solution/3500-3599/3503.Longest Palindrome After Substring Concatenation I/README_EN.md

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README_EN.md
5+
tags:
6+
- Two Pointers
7+
- String
8+
- Dynamic Programming
9+
- Enumeration
510
---
611

712
<!-- problem:start -->

‎solution/3500-3599/3504.Longest Palindrome After Substring Concatenation II/README.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README.md
5+
tags:
6+
- 双指针
7+
- 字符串
8+
- 动态规划
59
---
610

711
<!-- problem:start -->

‎solution/3500-3599/3504.Longest Palindrome After Substring Concatenation II/README_EN.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README_EN.md
5+
tags:
6+
- Two Pointers
7+
- String
8+
- Dynamic Programming
59
---
610

711
<!-- problem:start -->

‎solution/3500-3599/3505.Minimum Operations to Make Elements Within K Subarrays Equal/README.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,13 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README.md
5+
tags:
6+
- 数组
7+
- 哈希表
8+
- 数学
9+
- 动态规划
10+
- 滑动窗口
11+
- 堆（优先队列）
512
---
613

714
<!-- problem:start -->

‎solution/3500-3599/3505.Minimum Operations to Make Elements Within K Subarrays Equal/README_EN.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,13 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README_EN.md
5+
tags:
6+
- Array
7+
- Hash Table
8+
- Math
9+
- Dynamic Programming
10+
- Sliding Window
11+
- Heap (Priority Queue)
512
---
613

714
<!-- problem:start -->

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README.md renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README.md

Lines changed: 31 additions & 29 deletions
Original file line numberDiff line numberDiff line change
@@ -1,76 +1,78 @@
11
---
22
comments: true
33
difficulty: 困难
4-
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md
4+
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README.md
55
---
66

77
<!-- problem:start -->
88

9-
# [3506. Find Time Required to Eliminate Bacterial Strains II 🔒](https://leetcode.cn/problems/find-time-required-to-eliminate-bacterial-strains-ii)
9+
# [3506. 查找消除细菌菌株所需时间 II 🔒](https://leetcode.cn/problems/find-time-required-to-eliminate-bacterial-strains)
1010

11-
[English Version](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README_EN.md)
11+
[English Version](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README_EN.md)
1212

1313
## 题目描述
1414

1515
<!-- description:start -->
1616

17-
<p>You are given an integer array <code>timeReq</code> and an integer <code>splitTime</code>.</p>
17+
<p>给定一个整数数组&nbsp;<code>timeReq</code>&nbsp;和一个整数&nbsp;<code>splitTime</code>。</p>
1818

19-
<p>In the microscopic world of the human body, the immune system faces an extraordinary challenge: combatting a rapidly multiplying bacterial colony that threatens the body&#39;s survival.</p>
19+
<p>在人体微观世界中，免疫系统面临着一项非凡的挑战：对抗快速繁殖的细菌群落，这对身体的生存构成威胁。</p>
2020

21-
<p>Initially, only one <strong>white blood cell</strong> (<strong>WBC</strong>) is deployed to eliminate the bacteria. However, the lone WBC quickly realizes it cannot keep up with the bacterial growth rate.</p>
21+
<p>最初，只部署一个 <strong>白细胞</strong>（<strong>WBC</strong>）来消除细菌。然而，单独的白细胞很快意识到它无法跟上细菌的生长速度。</p>
2222

23-
<p>The WBC devises a clever strategy to fight the bacteria:</p>
23+
<p>WBC制定了一种巧妙的策略来对抗细菌：</p>
2424

2525
<ul>
26-
<li>The <code>i<sup>th</sup></code> bacterial strain takes <code>timeReq[i]</code> units of time to be eliminated.</li>
27-
<li>A single WBC can eliminate <strong>only one</strong> bacterial strain. Afterwards, the WBC is exhausted and cannot perform any other tasks.</li>
28-
<li>A WBC can split itself into two WBCs, but this requires <code>splitTime</code> units of time. Once split, the two WBCs can work in <strong>parallel</strong> on eliminating the bacteria.</li>
29-
<li><em>Only one</em> WBC can work on a single bacterial strain. Multiple WBCs <strong>cannot</strong> attack one strain in parallel.</li>
26+
<li>第 <code>i</code> 个细菌菌株需要 <code>timeReq[i]</code> 个时间单位来被消除。</li>
27+
<li>单个白细胞只能消除 <strong>一种</strong> 细菌菌株。之后，白细胞耗尽，无法执行任何其他任务。</li>
28+
<li>一个白细胞可以将自身分裂为两个白细胞，但这需要&nbsp;<code>splitTime</code>&nbsp;单位时间。一旦分裂，两个白细胞就可以 <strong>并行</strong> 消灭细菌。</li>
29+
<li>仅有一个白细胞可以针对一个单一细菌菌株工作。多个白细胞不能同时攻击一个菌株。</li>
3030
</ul>
3131

32-
<p>You must determine the <strong>minimum</strong> time required to eliminate all the bacterial strains.</p>
32+
<p>您必须确定消除所有细菌菌株所需的 <strong>最短</strong> 时间。</p>
3333

34-
<p><strong>Note</strong> that the bacterial strains can be eliminated in any order.</p>
34+
<p><strong>注意</strong>，细菌菌株可以按任何顺序消除。</p>
3535

3636
<p>&nbsp;</p>
37-
<p><strong class="example">Example 1:</strong></p>
37+
38+
<p><strong class="example">示例 1：</strong></p>
3839

3940
<div class="example-block">
40-
<p><strong>Input:</strong> <span class="example-io">timeReq = [10,4,5], splitTime = 2</span></p>
41+
<p><span class="example-io"><b>输入：</b>timeReq = [10,4,5], splitTime = 2</span></p>
4142

42-
<p><strong>Output:</strong> <span class="example-io">12</span></p>
43+
<p><span class="example-io"><b>输出：</b>12</span></p>
4344

44-
<p><strong>Explanation:</strong></p>
45+
<p><b>解释：</b></p>
4546

46-
<p>The elimination process goes as follows:</p>
47+
<p>消除过程如下：</p>
4748

4849
<ul>
49-
<li>Initially, there is a single WBC. The WBC splits into 2 WBCs after 2 units of time.</li>
50-
<li>One of the WBCs eliminates strain 0 at a time <code>t = 2 + 10 = 12.</code> The other WBC splits again, using 2 units of time.</li>
51-
<li>The 2 new WBCs eliminate the bacteria at times <code>t = 2 + 2 + 4</code> and <code>t = 2 + 2 + 5</code>.</li>
50+
<li>最初，有一个白细胞。经过 2 个时间单位后，白细胞分裂成 2 个白细胞。</li>
51+
<li>其中一个白细胞在&nbsp;<code>t = 2 + 10 = 12</code>&nbsp;时间内消除菌株 0。另一个白细胞使用 2 个单位时间再次分裂。</li>
52+
<li>2 个新的白细胞消灭细菌的时间是 <code>t = 2 + 2 + 4</code> 和&nbsp;<code>t = 2 + 2 + 5</code>。</li>
5253
</ul>
5354
</div>
5455

55-
<p><strong class="example">Example 2:</strong></p>
56+
<p><strong class="example">示例 2：</strong></p>
5657

5758
<div class="example-block">
58-
<p><strong>Input:</strong> <span class="example-io">timeReq = [10,4], splitTime = 5</span></p>
59+
<p><span class="example-io"><b>输入：</b>timeReq = [10,4], splitTime = 5</span></p>
5960

60-
<p><strong>Output:</strong>15</p>
61+
<p><b>输出：</b>5</p>
6162

62-
<p><strong>Explanation:</strong></p>
63+
<p><strong>解释：</strong></p>
6364

64-
<p>The elimination process goes as follows:</p>
65+
<p>消除过程如下：</p>
6566

6667
<ul>
67-
<li>Initially, there is a single WBC. The WBC splits into 2 WBCs after 5 units of time.</li>
68-
<li>The 2 new WBCs eliminate the bacteria at times <code>t = 5 + 10</code> and <code>t = 5 + 4</code>.</li>
68+
<li>最初，有一个白细胞。经过 5 个时间单位后，白细胞分裂成 2 个白细胞。</li>
69+
<li>2 个新的白细胞消灭细菌的时间是&nbsp;<code>t = 5 + 10</code> 和&nbsp;<code>t = 5 + 4</code>。</li>
6970
</ul>
7071
</div>
7172

7273
<p>&nbsp;</p>
73-
<p><strong>Constraints:</strong></p>
74+
75+
<p><strong>提示：</strong></p>
7476

7577
<ul>
7678
<li><code>2 &lt;= timeReq.length &lt;= 10<sup>5</sup></code></li>

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/README_EN.md renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README_EN.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
---
22
comments: true
33
difficulty: Hard
4-
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README_EN.md
4+
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README_EN.md
55
---
66

77
<!-- problem:start -->
88

9-
# [3506. Find Time Required to Eliminate Bacterial Strains II 🔒](https://leetcode.com/problems/find-time-required-to-eliminate-bacterial-strains-ii)
9+
# [3506. Find Time Required to Eliminate Bacterial Strains 🔒](https://leetcode.com/problems/find-time-required-to-eliminate-bacterial-strains)
1010

11-
[中文文档](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md)
11+
[中文文档](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README.md)
1212

1313
## Description
1414

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.cpp renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.cpp

File renamed without changes.

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.go renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.go

File renamed without changes.

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.java renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.java

File renamed without changes.

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.py renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.py

File renamed without changes.

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.rs renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.rs

File renamed without changes.

‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains II/Solution.ts renamed to ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/Solution.ts

File renamed without changes.

‎solution/DATABASE_README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -313,7 +313,7 @@
313313
| 3465 | [查找具有有效序列号的产品](/solution/3400-3499/3465.Find%20Products%20with%20Valid%20Serial%20Numbers/README.md) | `数据库` | 简单 | |
314314
| 3475 | [DNA 模式识别](/solution/3400-3499/3475.DNA%20Pattern%20Recognition/README.md) | | 中等 | |
315315
| 3482 | [分析组织层级](/solution/3400-3499/3482.Analyze%20Organization%20Hierarchy/README.md) | `数据库` | 困难 | |
316-
| 3497 | [分析订阅转化](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README.md) | | 中等 | |
316+
| 3497 | [分析订阅转化](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README.md) | `数据库` | 中等 | |
317317

318318
## 版权
319319

‎solution/DATABASE_README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -311,7 +311,7 @@ Press <kbd>Control</kbd> + <kbd>F</kbd>(or <kbd>Command</kbd> + <kbd>F</kbd> on
311311
| 3465 | [Find Products with Valid Serial Numbers](/solution/3400-3499/3465.Find%20Products%20with%20Valid%20Serial%20Numbers/README_EN.md) | `Database` | Easy | |
312312
| 3475 | [DNA Pattern Recognition](/solution/3400-3499/3475.DNA%20Pattern%20Recognition/README_EN.md) | | Medium | |
313313
| 3482 | [Analyze Organization Hierarchy](/solution/3400-3499/3482.Analyze%20Organization%20Hierarchy/README_EN.md) | `Database` | Hard | |
314-
| 3497 | [Analyze Subscription Conversion](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README_EN.md) | | Medium | |
314+
| 3497 | [Analyze Subscription Conversion](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README_EN.md) | `Database` | Medium | |
315315

316316
## Copyright
317317

‎solution/README.md

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -3506,17 +3506,17 @@
35063506
| 3493 | [属性图](/solution/3400-3499/3493.Properties%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 中等 | 第 442 场周赛 |
35073507
| 3494 | [酿造药水需要的最少总时间](/solution/3400-3499/3494.Find%20the%20Minimum%20Amount%20of%20Time%20to%20Brew%20Potions/README.md) | `数组`,`前缀和`,`模拟` | 中等 | 第 442 场周赛 |
35083508
| 3495 | [使数组元素都变为零的最少操作次数](/solution/3400-3499/3495.Minimum%20Operations%20to%20Make%20Array%20Elements%20Zero/README.md) | `位运算`,`数组`,`数学` | 困难 | 第 442 场周赛 |
3509-
| 3496 | [最大化配对删除后的得分](/solution/3400-3499/3496.Maximize%20Score%20After%20Pair%20Deletions/README.md) | | 中等 | 🔒 |
3510-
| 3497 | [分析订阅转化](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README.md) | | 中等 | |
3511-
| 3498 | [字符串的反转度](/solution/3400-3499/3498.Reverse%20Degree%20of%20a%20String/README.md) | | 简单 | 第 153 场双周赛 |
3512-
| 3499 | [操作后最大活跃区段数 I](/solution/3400-3499/3499.Maximize%20Active%20Section%20with%20Trade%20I/README.md) | | 中等 | 第 153 场双周赛 |
3513-
| 3500 | [将数组分割为子数组的最小代价](/solution/3500-3599/3500.Minimum%20Cost%20to%20Divide%20Array%20Into%20Subarrays/README.md) | | 困难 | 第 153 场双周赛 |
3514-
| 3501 | [操作后最大活跃区段数 II](/solution/3500-3599/3501.Maximize%20Active%20Section%20with%20Trade%20II/README.md) | | 困难 | 第 153 场双周赛 |
3515-
| 3502 | [到达每个位置的最小费用](/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README.md) | | 简单 | 第 443 场周赛 |
3516-
| 3503 | [子字符串连接后的最长回文串 I](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README.md) | | 中等 | 第 443 场周赛 |
3517-
| 3504 | [子字符串连接后的最长回文串 II](/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README.md) | | 困难 | 第 443 场周赛 |
3518-
| 3505 | [使 K 个子数组内元素相等的最少操作数](/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README.md) | | 困难 | 第 443 场周赛 |
3519-
| 3506 | [Find Time Required to Eliminate Bacterial Strains II](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains%20II/README.md) | | 困难 | 🔒 |
3509+
| 3496 | [最大化配对删除后的得分](/solution/3400-3499/3496.Maximize%20Score%20After%20Pair%20Deletions/README.md) | `贪心`,`数组` | 中等 | 🔒 |
3510+
| 3497 | [分析订阅转化](/solution/3400-3499/3497.Analyze%20Subscription%20Conversion/README.md) | `数据库` | 中等 | |
3511+
| 3498 | [字符串的反转度](/solution/3400-3499/3498.Reverse%20Degree%20of%20a%20String/README.md) | `字符串`,`模拟` | 简单 | 第 153 场双周赛 |
3512+
| 3499 | [操作后最大活跃区段数 I](/solution/3400-3499/3499.Maximize%20Active%20Section%20with%20Trade%20I/README.md) | `字符串`,`枚举` | 中等 | 第 153 场双周赛 |
3513+
| 3500 | [将数组分割为子数组的最小代价](/solution/3500-3599/3500.Minimum%20Cost%20to%20Divide%20Array%20Into%20Subarrays/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 153 场双周赛 |
3514+
| 3501 | [操作后最大活跃区段数 II](/solution/3500-3599/3501.Maximize%20Active%20Section%20with%20Trade%20II/README.md) | `线段树`,`数组`,`字符串`,`二分查找` | 困难 | 第 153 场双周赛 |
3515+
| 3502 | [到达每个位置的最小费用](/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README.md) | `数组` | 简单 | 第 443 场周赛 |
3516+
| 3503 | [子字符串连接后的最长回文串 I](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README.md) | `双指针`,`字符串`,`动态规划`,`枚举` | 中等 | 第 443 场周赛 |
3517+
| 3504 | [子字符串连接后的最长回文串 II](/solution/3500-3599/3504.Longest%20Palindrome%20After%20Substring%20Concatenation%20II/README.md) | `双指针`,`字符串`,`动态规划` | 困难 | 第 443 场周赛 |
3518+
| 3505 | [使 K 个子数组内元素相等的最少操作数](/solution/3500-3599/3505.Minimum%20Operations%20to%20Make%20Elements%20Within%20K%20Subarrays%20Equal/README.md) | `数组`,`哈希表`,`数学`,`动态规划`,`滑动窗口`,`堆（优先队列）` | 困难 | 第 443 场周赛 |
3519+
| 3506 | [查找消除细菌菌株所需时间 II](/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README.md) | | 困难 | 🔒 |
35203520

35213521
## 版权
35223522

0 commit comments

Comments
 (0)