Skip to content

feat: add new lc problems #4359

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 18, 2025
Merged

feat: add new lc problems #4359

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 8 additions & 3 deletions ...tion/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README.md
tags:
- 贪心
- 数组
- 数学
- 堆（优先队列）
---

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

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

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

<p><b>输出：</b>5</p>
<p><b>输出：</b>15</p>

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

Expand Down
5 changes: 5 additions & 0 deletions ...n/3500-3599/3506.Find Time Required to Eliminate Bacterial Strains/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3506.Find%20Time%20Required%20to%20Eliminate%20Bacterial%20Strains/README_EN.md
tags:
- Greedy
- Array
- Math
- Heap (Priority Queue)
---

<!-- problem:start -->
Expand Down
8 changes: 8 additions & 0 deletions solution/3500-3599/3507.Minimum Pair Removal to Sort Array I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,14 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3507.Minimum%20Pair%20Removal%20to%20Sort%20Array%20I/README.md
tags:
- 数组
- 哈希表
- 链表
- 双向链表
- 有序集合
- 模拟
- 堆（优先队列）
---

<!-- problem:start -->
Expand Down
8 changes: 8 additions & 0 deletions solution/3500-3599/3507.Minimum Pair Removal to Sort Array I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,14 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3507.Minimum%20Pair%20Removal%20to%20Sort%20Array%20I/README_EN.md
tags:
- Array
- Hash Table
- Linked List
- Doubly-Linked List
- Ordered Set
- Simulation
- Heap (Priority Queue)
---

<!-- problem:start -->
Expand Down
7 changes: 7 additions & 0 deletions solution/3500-3599/3508.Implement Router/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,13 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3508.Implement%20Router/README.md
tags:
- 设计
- 队列
- 数组
- 哈希表
- 二分查找
- 有序集合
---

<!-- problem:start -->
Expand Down
7 changes: 7 additions & 0 deletions solution/3500-3599/3508.Implement Router/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,13 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3508.Implement%20Router/README_EN.md
tags:
- Design
- Queue
- Array
- Hash Table
- Binary Search
- Ordered Set
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions ...09.Maximum Product of Subsequences With an Alternating Sum Equal to K/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: 困难
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
tags:
- 数组
- 哈希表
- 动态规划
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions ...Maximum Product of Subsequences With an Alternating Sum Equal to K/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: Hard
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
tags:
- Array
- Hash Table
- Dynamic Programming
---

<!-- problem:start -->
Expand Down
3 changes: 3 additions & 0 deletions ...on/3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3512.Minimum%20Operations%20to%20Make%20Array%20Sum%20Divisible%20by%20K/README.md
tags:
- 数组
- 数学
---

<!-- problem:start -->
Expand Down
3 changes: 3 additions & 0 deletions ...3500-3599/3512.Minimum Operations to Make Array Sum Divisible by K/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,9 @@
comments: true
difficulty: Easy
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
tags:
- Array
- Math
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3513.Number of Unique XOR Triplets I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3513.Number%20of%20Unique%20XOR%20Triplets%20I/README.md
tags:
- 位运算
- 数组
- 数学
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3513.Number of Unique XOR Triplets I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3513.Number%20of%20Unique%20XOR%20Triplets%20I/README_EN.md
tags:
- Bit Manipulation
- Array
- Math
---

<!-- problem:start -->
Expand Down
5 changes: 5 additions & 0 deletions solution/3500-3599/3514.Number of Unique XOR Triplets II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3514.Number%20of%20Unique%20XOR%20Triplets%20II/README.md
tags:
- 位运算
- 数组
- 数学
- 枚举
---

<!-- problem:start -->
Expand Down
5 changes: 5 additions & 0 deletions solution/3500-3599/3514.Number of Unique XOR Triplets II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3514.Number%20of%20Unique%20XOR%20Triplets%20II/README_EN.md
tags:
- Bit Manipulation
- Array
- Math
- Enumeration
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3500-3599/3515.Shortest Path in a Weighted Tree/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3515.Shortest%20Path%20in%20a%20Weighted%20Tree/README.md
tags:
- 树
- 深度优先搜索
- 树状数组
- 线段树
- 数组
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3500-3599/3515.Shortest Path in a Weighted Tree/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3515.Shortest%20Path%20in%20a%20Weighted%20Tree/README_EN.md
tags:
- Tree
- Depth-First Search
- Binary Indexed Tree
- Segment Tree
- Array
---

<!-- problem:start -->
Expand Down
2 changes: 2 additions & 0 deletions solution/3500-3599/3516.Find Closest Person/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: 简单
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3516.Find%20Closest%20Person/README.md
tags:
- 数学
---

<!-- problem:start -->
Expand Down
2 changes: 2 additions & 0 deletions solution/3500-3599/3516.Find Closest Person/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,8 @@
comments: true
difficulty: Easy
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3516.Find%20Closest%20Person/README_EN.md
tags:
- Math
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3517.Smallest Palindromic Rearrangement I/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: 中等
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3517.Smallest%20Palindromic%20Rearrangement%20I/README.md
tags:
- 字符串
- 计数排序
- 排序
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3517.Smallest Palindromic Rearrangement I/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: Medium
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3517.Smallest%20Palindromic%20Rearrangement%20I/README_EN.md
tags:
- String
- Counting Sort
- Sorting
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3500-3599/3518.Smallest Palindromic Rearrangement II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3518.Smallest%20Palindromic%20Rearrangement%20II/README.md
tags:
- 哈希表
- 数学
- 字符串
- 组合数学
- 计数
---

<!-- problem:start -->
Expand Down
6 changes: 6 additions & 0 deletions solution/3500-3599/3518.Smallest Palindromic Rearrangement II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,12 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3518.Smallest%20Palindromic%20Rearrangement%20II/README_EN.md
tags:
- Hash Table
- Math
- String
- Combinatorics
- Counting
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3519.Count Numbers with Non-Decreasing Digits/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: 困难
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3519.Count%20Numbers%20with%20Non-Decreasing%20Digits/README.md
tags:
- 数学
- 字符串
- 动态规划
---

<!-- problem:start -->
Expand Down
4 changes: 4 additions & 0 deletions solution/3500-3599/3519.Count Numbers with Non-Decreasing Digits/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,10 @@
comments: true
difficulty: Hard
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3519.Count%20Numbers%20with%20Non-Decreasing%20Digits/README_EN.md
tags:
- Math
- String
- Dynamic Programming
---

<!-- problem:start -->
Expand Down
Loading