Skip to content

Commit ab56a62

Browse files
yanglbmeyanglbme
committed
feat: add new lc problems
1 parent 2ca052a commit ab56a62

File tree

32 files changed

+740
-27
lines changed

32 files changed

+740
-27
lines changed

Diff for: ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README.md

+8-3
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/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README.md
5+
tags:
6+
- 贪心
7+
- 数组
8+
- 数学
9+
- 堆（优先队列）
510
---
611

712
<!-- problem:start -->
@@ -24,9 +29,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Fi
2429

2530
<ul>
2631
<li>第 <code>i</code> 个细菌菌株需要 <code>timeReq[i]</code> 个时间单位来被消除。</li>
27-
<li>单个白细胞只能消除 <strong>一种</strong> 细菌菌株。之后，白细胞耗尽，无法执行任何其他任务。</li>
32+
<li>单个白细胞只能消除 <strong>一个</strong> 细菌菌株。之后，白细胞耗尽，无法执行任何其他任务。</li>
2833
<li>一个白细胞可以将自身分裂为两个白细胞，但这需要&nbsp;<code>splitTime</code>&nbsp;单位时间。一旦分裂，两个白细胞就可以 <strong>并行</strong> 消灭细菌。</li>
29-
<li>仅有一个白细胞可以针对一个单一细菌菌株工作。多个白细胞不能同时攻击一个菌株。</li>
34+
<li>一个白细胞仅可以攻击一个细菌菌株。多个白细胞不能同时攻击一个菌株。</li>
3035
</ul>
3136

3237
<p>您必须确定消除所有细菌菌株所需的 <strong>最短</strong> 时间。</p>
@@ -58,7 +63,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Fi
5863
<div class="example-block">
5964
<p><span class="example-io"><b>输入：</b>timeReq = [10,4], splitTime = 5</span></p>
6065

61-
<p><b>输出：</b>5</p>
66+
<p><b>输出：</b>15</p>
6267

6368
<p><strong>解释：</strong></p>
6469

Diff for: ‎solution/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README_EN.md

+5
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/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README_EN.md
5+
tags:
6+
- Greedy
7+
- Array
8+
- Math
9+
- Heap (Priority Queue)
510
---
611

712
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3507.Minimum Pair Removal to Sort Array I/README.md

+8
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,14 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3507.Minimum%20Pair%20Removal%20to%20Sort%20Array%20I/README.md
5+
tags:
6+
- 数组
7+
- 哈希表
8+
- 链表
9+
- 双向链表
10+
- 有序集合
11+
- 模拟
12+
- 堆（优先队列）
513
---
614

715
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3507.Minimum Pair Removal to Sort Array I/README_EN.md

+8
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,14 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3507.Minimum%20Pair%20Removal%20to%20Sort%20Array%20I/README_EN.md
5+
tags:
6+
- Array
7+
- Hash Table
8+
- Linked List
9+
- Doubly-Linked List
10+
- Ordered Set
11+
- Simulation
12+
- Heap (Priority Queue)
513
---
614

715
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3508.Implement Router/README.md

+7
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/3508.Implement%20Router/README.md
5+
tags:
6+
- 设计
7+
- 队列
8+
- 数组
9+
- 哈希表
10+
- 二分查找
11+
- 有序集合
512
---
613

714
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3508.Implement Router/README_EN.md

+7
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,13 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3508.Implement%20Router/README_EN.md
5+
tags:
6+
- Design
7+
- Queue
8+
- Array
9+
- Hash Table
10+
- Binary Search
11+
- Ordered Set
512
---
613

714
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3509.Maximum Product of Subsequences With an Alternating Sum Equal to K/README.md

+4
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/3509.Maximum%20Product%20of%20Subsequences%20With%20an%20Alternating%20Sum%20Equal%20to%20K/README.md
5+
tags:
6+
- 数组
7+
- 哈希表
8+
- 动态规划
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3509.Maximum Product of Subsequences With an Alternating Sum Equal to K/README_EN.md

+4
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/3509.Maximum%20Product%20of%20Subsequences%20With%20an%20Alternating%20Sum%20Equal%20to%20K/README_EN.md
5+
tags:
6+
- Array
7+
- Hash Table
8+
- Dynamic Programming
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md

+3
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/3500-3599/3512.Minimum%20Operations%20to%20Make%20Array%20Sum%20Divisible%20by%20K/README.md
5+
tags:
6+
- 数组
7+
- 数学
58
---
69

710
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md

+3
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/3500-3599/3512.Minimum%20Operations%20to%20Make%20Array%20Sum%20Divisible%20by%20K/README_EN.md
5+
tags:
6+
- Array
7+
- Math
58
---
69

710
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3513.Number of Unique XOR Triplets I/README.md

+4
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/3513.Number%20of%20Unique%20XOR%20Triplets%20I/README.md
5+
tags:
6+
- 位运算
7+
- 数组
8+
- 数学
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3513.Number of Unique XOR Triplets I/README_EN.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3513.Number%20of%20Unique%20XOR%20Triplets%20I/README_EN.md
5+
tags:
6+
- Bit Manipulation
7+
- Array
8+
- Math
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3514.Number of Unique XOR Triplets II/README.md

+5
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/3514.Number%20of%20Unique%20XOR%20Triplets%20II/README.md
5+
tags:
6+
- 位运算
7+
- 数组
8+
- 数学
9+
- 枚举
510
---
611

712
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3514.Number of Unique XOR Triplets II/README_EN.md

+5
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/3514.Number%20of%20Unique%20XOR%20Triplets%20II/README_EN.md
5+
tags:
6+
- Bit Manipulation
7+
- Array
8+
- Math
9+
- Enumeration
510
---
611

712
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3515.Shortest Path in a Weighted Tree/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3515.Shortest%20Path%20in%20a%20Weighted%20Tree/README.md
5+
tags:
6+
- 树
7+
- 深度优先搜索
8+
- 树状数组
9+
- 线段树
10+
- 数组
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3515.Shortest Path in a Weighted Tree/README_EN.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3515.Shortest%20Path%20in%20a%20Weighted%20Tree/README_EN.md
5+
tags:
6+
- Tree
7+
- Depth-First Search
8+
- Binary Indexed Tree
9+
- Segment Tree
10+
- Array
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3516.Find Closest Person/README.md

+2
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/3516.Find%20Closest%20Person/README.md
5+
tags:
6+
- 数学
57
---
68

79
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3516.Find Closest Person/README_EN.md

+2
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/3516.Find%20Closest%20Person/README_EN.md
5+
tags:
6+
- Math
57
---
68

79
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3517.Smallest Palindromic Rearrangement I/README.md

+4
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/3517.Smallest%20Palindromic%20Rearrangement%20I/README.md
5+
tags:
6+
- 字符串
7+
- 计数排序
8+
- 排序
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3517.Smallest Palindromic Rearrangement I/README_EN.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3517.Smallest%20Palindromic%20Rearrangement%20I/README_EN.md
5+
tags:
6+
- String
7+
- Counting Sort
8+
- Sorting
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3518.Smallest Palindromic Rearrangement II/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3518.Smallest%20Palindromic%20Rearrangement%20II/README.md
5+
tags:
6+
- 哈希表
7+
- 数学
8+
- 字符串
9+
- 组合数学
10+
- 计数
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3518.Smallest Palindromic Rearrangement II/README_EN.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3518.Smallest%20Palindromic%20Rearrangement%20II/README_EN.md
5+
tags:
6+
- Hash Table
7+
- Math
8+
- String
9+
- Combinatorics
10+
- Counting
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3519.Count Numbers with Non-Decreasing Digits/README.md

+4
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/3519.Count%20Numbers%20with%20Non-Decreasing%20Digits/README.md
5+
tags:
6+
- 数学
7+
- 字符串
8+
- 动态规划
59
---
610

711
<!-- problem:start -->

Diff for: ‎solution/3500-3599/3519.Count Numbers with Non-Decreasing Digits/README_EN.md

+4
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/3519.Count%20Numbers%20with%20Non-Decreasing%20Digits/README_EN.md
5+
tags:
6+
- Math
7+
- String
8+
- Dynamic Programming
59
---
610

711
<!-- problem:start -->

0 commit comments

Comments
 (0)