diff --git a/solution/0300-0399/0350.Intersection of Two Arrays II/README_EN.md b/solution/0300-0399/0350.Intersection of Two Arrays II/README_EN.md index c5f278ca9b827..5db82879f3a8a 100644 --- a/solution/0300-0399/0350.Intersection of Two Arrays II/README_EN.md +++ b/solution/0300-0399/0350.Intersection of Two Arrays II/README_EN.md @@ -246,7 +246,6 @@ public class Solution { } ``` - ### **...** ``` diff --git a/solution/2900-2999/2923.Find Champion I/README.md b/solution/2900-2999/2923.Find Champion I/README.md new file mode 100644 index 0000000000000..9efcf9c0604c4 --- /dev/null +++ b/solution/2900-2999/2923.Find Champion I/README.md @@ -0,0 +1,92 @@ +# [2923. 找到冠军 I](https://leetcode.cn/problems/find-champion-i) + +[English Version](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) + +## 题目描述 + + + +

一场比赛中共有 n 支队伍，按从 0 到  n - 1 编号。

+ +

给你一个下标从 0 开始、大小为 n * n 的二维布尔矩阵 grid 。对于满足 0 <= i, j <= n - 1 且 i != j 的所有 i, j ：如果 grid[i][j] == 1，那么 i 队比 j 队 强 ；否则，j 队比 i 队 强 。

+ +

在这场比赛中，如果不存在某支强于 a 队的队伍，则认为 a 队将会是 冠军 。

+ +

返回这场比赛中将会成为冠军的队伍。

+ +

 

+ +

示例 1：

+ +
+输入：grid = [[0,1],[0,0]]
+输出：0
+解释：比赛中有两支队伍。
+grid[0][1] == 1 表示 0 队比 1 队强。所以 0 队是冠军。
+
+ +

示例 2：

+ +
+输入：grid = [[0,0,1],[1,0,1],[0,0,0]]
+输出：1
+解释：比赛中有三支队伍。
+grid[1][0] == 1 表示 1 队比 0 队强。
+grid[1][2] == 1 表示 1 队比 2 队强。
+所以 1 队是冠军。
+
+ +

 

+ +

提示：

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2923.Find Champion I/README_EN.md b/solution/2900-2999/2923.Find Champion I/README_EN.md new file mode 100644 index 0000000000000..b98e8bd7aecb8 --- /dev/null +++ b/solution/2900-2999/2923.Find Champion I/README_EN.md @@ -0,0 +1,82 @@ +# [2923. Find Champion I](https://leetcode.com/problems/find-champion-i) + +[中文文档](/solution/2900-2999/2923.Find%20Champion%20I/README.md) + +## Description + +

There are n teams numbered from 0 to n - 1 in a tournament.

+ +

Given a 0-indexed 2D boolean matrix grid of size n * n. For all i, j that 0 <= i, j <= n - 1 and i != j team i is stronger than team j if grid[i][j] == 1, otherwise, team j is stronger than team i.

+ +

Team a will be the champion of the tournament if there is no team b that is stronger than team a.

+ +

Return the team that will be the champion of the tournament.

+ +

 

+

Example 1:

+ +
+Input: grid = [[0,1],[0,0]]
+Output: 0
+Explanation: There are two teams in this tournament.
+grid[0][1] == 1 means that team 0 is stronger than team 1. So team 0 will be the champion.
+
+ +

Example 2:

+ +
+Input: grid = [[0,0,1],[1,0,1],[0,0,0]]
+Output: 1
+Explanation: There are three teams in this tournament.
+grid[1][0] == 1 means that team 1 is stronger than team 0.
+grid[1][2] == 1 means that team 1 is stronger than team 2.
+So team 1 will be the champion.
+
+ +

 

+

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2924.Find Champion II/README.md b/solution/2900-2999/2924.Find Champion II/README.md new file mode 100644 index 0000000000000..9b192f88c8237 --- /dev/null +++ b/solution/2900-2999/2924.Find Champion II/README.md @@ -0,0 +1,103 @@ +# [2924. 找到冠军 II](https://leetcode.cn/problems/find-champion-ii) + +[English Version](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) + +## 题目描述 + + + +

一场比赛中共有 n 支队伍，按从 0 到  n - 1 编号。每支队伍也是 有向无环图（DAG） 上的一个节点。

+ +

给你一个整数 n 和一个下标从 0 开始、长度为 m 的二维整数数组 edges 表示这个有向无环图，其中 edges[i] = [ui, vi] 表示图中存在一条从 ui 队到 vi 队的有向边。

+ +

从 a 队到 b 队的有向边意味着 a 队比 b 队 强 ，也就是 b 队比 a 队 弱 。

+ +

在这场比赛中，如果不存在某支强于 a 队的队伍，则认为 a 队将会是 冠军 。

+ +

如果这场比赛存在 唯一 一个冠军，则返回将会成为冠军的队伍。否则，返回 -1 。

+ +

注意

+ + + +

 

+ +

示例 1：

+ +

+ +
+输入：n = 3, edges = [[0,1],[1,2]]
+输出：0
+解释：1 队比 0 队弱。2 队比 1 队弱。所以冠军是 0 队。
+
+ +

示例 2：

+ +

+ +
+输入：n = 4, edges = [[0,2],[1,3],[1,2]]
+输出：-1
+解释：2 队比 0 队和 1 队弱。3 队比 1 队弱。但是 1 队和 0 队之间不存在强弱对比。所以答案是 -1 。
+
+ +

 

+ +

提示：

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2924.Find Champion II/README_EN.md b/solution/2900-2999/2924.Find Champion II/README_EN.md new file mode 100644 index 0000000000000..9469f4105d4f2 --- /dev/null +++ b/solution/2900-2999/2924.Find Champion II/README_EN.md @@ -0,0 +1,93 @@ +# [2924. Find Champion II](https://leetcode.com/problems/find-champion-ii) + +[中文文档](/solution/2900-2999/2924.Find%20Champion%20II/README.md) + +## Description + +

There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG.

+ +

You are given the integer n and a 0-indexed 2D integer array edges of length m representing the DAG, where edges[i] = [ui, vi] indicates that there is a directed edge from team ui to team vi in the graph.

+ +

A directed edge from a to b in the graph means that team a is stronger than team b and team b is weaker than team a.

+ +

Team a will be the champion of the tournament if there is no team b that is stronger than team a.

+ +

Return the team that will be the champion of the tournament if there is a unique champion, otherwise, return -1.

+ +

Notes

+ + + +

 

+

Example 1:

+ +

+ +
+Input: n = 3, edges = [[0,1],[1,2]]
+Output: 0
+Explanation: Team 1 is weaker than team 0. Team 2 is weaker than team 1. So the champion is team 0.
+
+ +

Example 2:

+ +

+ +
+Input: n = 4, edges = [[0,2],[1,3],[1,2]]
+Output: -1
+Explanation: Team 2 is weaker than team 0 and team 1. Team 3 is weaker than team 1. But team 1 and team 0 are not weaker than any other teams. So the answer is -1.
+
+ +

 

+

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2924.Find Champion II/images/graph-3.png b/solution/2900-2999/2924.Find Champion II/images/graph-3.png new file mode 100644 index 0000000000000..1cedc15ba81c8 Binary files /dev/null and b/solution/2900-2999/2924.Find Champion II/images/graph-3.png differ diff --git a/solution/2900-2999/2924.Find Champion II/images/graph-4.png b/solution/2900-2999/2924.Find Champion II/images/graph-4.png new file mode 100644 index 0000000000000..4f030c4a8250e Binary files /dev/null and b/solution/2900-2999/2924.Find Champion II/images/graph-4.png differ diff --git a/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README.md b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README.md new file mode 100644 index 0000000000000..8ab1f6d8cae91 --- /dev/null +++ b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README.md @@ -0,0 +1,108 @@ +# [2925. 在树上执行操作以后得到的最大分数](https://leetcode.cn/problems/maximum-score-after-applying-operations-on-a-tree) + +[English Version](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) + +## 题目描述 + + + +

有一棵 n 个节点的无向树，节点编号为 0 到 n - 1 ，根节点编号为 0 。给你一个长度为 n - 1 的二维整数数组 edges 表示这棵树，其中 edges[i] = [ai, bi] 表示树中节点 ai 和 bi 有一条边。

+ +

同时给你一个长度为 n 下标从 0 开始的整数数组 values ，其中 values[i] 表示第 i 个节点的值。

+ +

一开始你的分数为 0 ，每次操作中，你将执行：

+ + + +

如果从根节点出发，到任意叶子节点经过的路径上的节点值之和都不等于 0 ，那么我们称这棵树是 健康的 。

+ +

你可以对这棵树执行任意次操作，但要求执行完所有操作以后树是 健康的 ，请你返回你可以获得的 最大分数 。

+ +

 

+ +

示例 1：

+ +

+ +
+输入：edges = [[0,1],[0,2],[0,3],[2,4],[4,5]], values = [5,2,5,2,1,1]
+输出：11
+解释：我们可以选择节点 1 ，2 ，3 ，4 和 5 。根节点的值是非 0 的。所以从根出发到任意叶子节点路径上节点值之和都不为 0 。所以树是健康的。你的得分之和为 values[1] + values[2] + values[3] + values[4] + values[5] = 11 。
+11 是你对树执行任意次操作以后可以获得的最大得分之和。
+
+ +

示例 2：

+ +

+ +
+输入：edges = [[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]], values = [20,10,9,7,4,3,5]
+输出：40
+解释：我们选择节点 0 ，2 ，3 和 4 。
+- 从 0 到 4 的节点值之和为 10 。
+- 从 0 到 3 的节点值之和为 10 。
+- 从 0 到 5 的节点值之和为 3 。
+- 从 0 到 6 的节点值之和为 5 。
+所以树是健康的。你的得分之和为 values[0] + values[2] + values[3] + values[4] = 40 。
+40 是你对树执行任意次操作以后可以获得的最大得分之和。
+
+ +

 

+ +

提示：

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README_EN.md b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README_EN.md new file mode 100644 index 0000000000000..e471b7bfda94f --- /dev/null +++ b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/README_EN.md @@ -0,0 +1,94 @@ +# [2925. Maximum Score After Applying Operations on a Tree](https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree) + +[中文文档](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) + +## Description + +

There is an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0. You are given a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

You are also given a 0-indexed integer array values of length n, where values[i] is the value associated with the ith node.

+ +

You start with a score of 0. In one operation, you can:

+ + + +

A tree is healthy if the sum of values on the path from the root to any leaf node is different than zero.

+ +

Return the maximum score you can obtain after performing these operations on the tree any number of times so that it remains healthy.

+ +

 

+

Example 1:

+ +
+Input: edges = [[0,1],[0,2],[0,3],[2,4],[4,5]], values = [5,2,5,2,1,1]
+Output: 11
+Explanation: We can choose nodes 1, 2, 3, 4, and 5. The value of the root is non-zero. Hence, the sum of values on the path from the root to any leaf is different than zero. Therefore, the tree is healthy and the score is values[1] + values[2] + values[3] + values[4] + values[5] = 11.
+It can be shown that 11 is the maximum score obtainable after any number of operations on the tree.
+
+ +

Example 2:

+ +
+Input: edges = [[0,1],[0,2],[1,3],[1,4],[2,5],[2,6]], values = [20,10,9,7,4,3,5]
+Output: 40
+Explanation: We can choose nodes 0, 2, 3, and 4.
+- The sum of values on the path from 0 to 4 is equal to 10.
+- The sum of values on the path from 0 to 3 is equal to 10.
+- The sum of values on the path from 0 to 5 is equal to 3.
+- The sum of values on the path from 0 to 6 is equal to 5.
+Therefore, the tree is healthy and the score is values[0] + values[2] + values[3] + values[4] = 40.
+It can be shown that 40 is the maximum score obtainable after any number of operations on the tree.
+
+ +

 

+

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-13-1.png b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-13-1.png new file mode 100644 index 0000000000000..5d67ba37c6ec2 Binary files /dev/null and b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-13-1.png differ diff --git a/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-14-2.png b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-14-2.png new file mode 100644 index 0000000000000..2bd958e8a17ea Binary files /dev/null and b/solution/2900-2999/2925.Maximum Score After Applying Operations on a Tree/images/graph-14-2.png differ diff --git a/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README.md b/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README.md new file mode 100644 index 0000000000000..ab913a50db6f6 --- /dev/null +++ b/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README.md @@ -0,0 +1,106 @@ +# [2926. 平衡子序列的最大和](https://leetcode.cn/problems/maximum-balanced-subsequence-sum) + +[English Version](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) + +## 题目描述 + + + +

给你一个下标从 0 开始的整数数组 nums 。

+ +

nums 一个长度为 k 的 子序列 指的是选出 k 个 下标 i0 < i1 < ... < ik-1 ，如果这个子序列满足以下条件，我们说它是 平衡的 ：

+ + + +

nums 长度为 1 的 子序列 是平衡的。

+ +

请你返回一个整数，表示 nums 平衡 子序列里面的 最大元素和 。

+ +

一个数组的 子序列 指的是从原数组中删除一些元素（也可能一个元素也不删除）后，剩余元素保持相对顺序得到的 非空 新数组。

+ +

 

+ +

示例 1：

+ +
+输入：nums = [3,3,5,6]
+输出：14
+解释：这个例子中，选择子序列 [3,5,6] ，下标为 0 ，2 和 3 的元素被选中。
+nums[2] - nums[0] >= 2 - 0 。
+nums[3] - nums[2] >= 3 - 2 。
+所以，这是一个平衡子序列，且它的和是所有平衡子序列里最大的。
+包含下标 1 ，2 和 3 的子序列也是一个平衡的子序列。
+最大平衡子序列和为 14 。
+ +

示例 2：

+ +
+输入：nums = [5,-1,-3,8]
+输出：13
+解释：这个例子中，选择子序列 [5,8] ，下标为 0 和 3 的元素被选中。
+nums[3] - nums[0] >= 3 - 0 。
+所以，这是一个平衡子序列，且它的和是所有平衡子序列里最大的。
+最大平衡子序列和为 13 。
+
+ +

示例 3：

+ +
+输入：nums = [-2,-1]
+输出：-1
+解释：这个例子中，选择子序列 [-1] 。
+这是一个平衡子序列，而且它的和是 nums 所有平衡子序列里最大的。
+
+ +

 

+ +

提示：

+ + + +## 解法 + + + + + +### **Python3** + + + +```python + +``` + +### **Java** + + + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README_EN.md b/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README_EN.md new file mode 100644 index 0000000000000..ebf76696c055c --- /dev/null +++ b/solution/2900-2999/2926.Maximum Balanced Subsequence Sum/README_EN.md @@ -0,0 +1,96 @@ +# [2926. Maximum Balanced Subsequence Sum](https://leetcode.com/problems/maximum-balanced-subsequence-sum) + +[中文文档](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) + +## Description + +

You are given a 0-indexed integer array nums.

+ +

A subsequence of nums having length k and consisting of indices i0 < i1 < ... < ik-1 is balanced if the following holds:

+ + + +

A subsequence of nums having length 1 is considered balanced.

+ +

Return an integer denoting the maximum possible sum of elements in a balanced subsequence of nums.

+ +

A subsequence of an array is a new non-empty array that is formed from the original array by deleting some (possibly none) of the elements without disturbing the relative positions of the remaining elements.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,3,5,6]
+Output: 14
+Explanation: In this example, the subsequence [3,5,6] consisting of indices 0, 2, and 3 can be selected.
+nums[2] - nums[0] >= 2 - 0.
+nums[3] - nums[2] >= 3 - 2.
+Hence, it is a balanced subsequence, and its sum is the maximum among the balanced subsequences of nums.
+The subsequence consisting of indices 1, 2, and 3 is also valid.
+It can be shown that it is not possible to get a balanced subsequence with a sum greater than 14.
+ +

Example 2:

+ +
+Input: nums = [5,-1,-3,8]
+Output: 13
+Explanation: In this example, the subsequence [5,8] consisting of indices 0 and 3 can be selected.
+nums[3] - nums[0] >= 3 - 0.
+Hence, it is a balanced subsequence, and its sum is the maximum among the balanced subsequences of nums.
+It can be shown that it is not possible to get a balanced subsequence with a sum greater than 13.
+
+ +

Example 3:

+ +
+Input: nums = [-2,-1]
+Output: -1
+Explanation: In this example, the subsequence [-1] can be selected.
+It is a balanced subsequence, and its sum is the maximum among the balanced subsequences of nums.
+
+ +

 

+

Constraints:

+ + + +## Solutions + + + +### **Python3** + +```python + +``` + +### **Java** + +```java + +``` + +### **C++** + +```cpp + +``` + +### **Go** + +```go + +``` + +### **...** + +``` + +``` + + diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md index 1e35f12bb5c89..91f7d75cdfa83 100644 --- a/solution/CONTEST_README.md +++ b/solution/CONTEST_README.md @@ -22,6 +22,13 @@ ## 往期竞赛 +#### 第 370 场周赛(2023-11-05 10:30, 90 分钟) 参赛人数 3983 + +- [2923. 找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) +- [2924. 找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) +- [2925. 在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) +- [2926. 平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) + #### 第 369 场周赛(2023-10-29 10:30, 90 分钟) 参赛人数 4121 - [2917. 找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md index 4eba855bbc6b9..8ba4134783ef2 100644 --- a/solution/CONTEST_README_EN.md +++ b/solution/CONTEST_README_EN.md @@ -25,6 +25,13 @@ Get your rating changes right after the completion of LeetCode contests, https:/ ## Past Contests +#### Weekly Contest 370 + +- [2923. Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) +- [2924. Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) +- [2925. Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) +- [2926. Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) + #### Weekly Contest 369 - [2917. Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) diff --git a/solution/JAVASCRIPT_README.md b/solution/JAVASCRIPT_README.md index 3f4d443a91359..37b2eb93a6701 100644 --- a/solution/JAVASCRIPT_README.md +++ b/solution/JAVASCRIPT_README.md @@ -24,7 +24,7 @@ | 2629 | [复合函数](/solution/2600-2699/2629.Function%20Composition/README.md) | | 简单 | | | 2630 | [记忆函数 II](/solution/2600-2699/2630.Memoize%20II/README.md) | | 困难 | | | 2631 | [分组](/solution/2600-2699/2631.Group%20By/README.md) | | 中等 | | -| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 中等 | 🔒 | +| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 困难 | 🔒 | | 2633 | [将对象转换为 JSON 字符串](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md) | | 中等 | 🔒 | | 2634 | [过滤数组中的元素](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README.md) | | 简单 | | | 2635 | [转换数组中的每个元素](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README.md) | | 简单 | | diff --git a/solution/JAVASCRIPT_README_EN.md b/solution/JAVASCRIPT_README_EN.md index 6d0c0dbc0b136..84361d3bc3554 100644 --- a/solution/JAVASCRIPT_README_EN.md +++ b/solution/JAVASCRIPT_README_EN.md @@ -22,7 +22,7 @@ Press Control + F(or Command + F on | 2629 | [Function Composition](/solution/2600-2699/2629.Function%20Composition/README_EN.md) | | Easy | | | 2630 | [Memoize II](/solution/2600-2699/2630.Memoize%20II/README_EN.md) | | Hard | | | 2631 | [Group By](/solution/2600-2699/2631.Group%20By/README_EN.md) | | Medium | | -| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Medium | 🔒 | +| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Hard | 🔒 | | 2633 | [Convert Object to JSON String](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) | | Medium | 🔒 | | 2634 | [Filter Elements from Array](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README_EN.md) | | Easy | | | 2635 | [Apply Transform Over Each Element in Array](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README_EN.md) | | Easy | | diff --git a/solution/README.md b/solution/README.md index 4520e2376d46c..d0bad30aff481 100644 --- a/solution/README.md +++ b/solution/README.md @@ -82,7 +82,7 @@ | 0069 | [x 的平方根 ](/solution/0000-0099/0069.Sqrt%28x%29/README.md) | `数学`,`二分查找` | 简单 | | | 0070 | [爬楼梯](/solution/0000-0099/0070.Climbing%20Stairs/README.md) | `记忆化搜索`,`数学`,`动态规划` | 简单 | | | 0071 | [简化路径](/solution/0000-0099/0071.Simplify%20Path/README.md) | `栈`,`字符串` | 中等 | | -| 0072 | [编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md) | `字符串`,`动态规划` | 中等 | | +| 0072 | [编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md) | `字符串`,`动态规划` | 困难 | | | 0073 | [矩阵置零](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | | | 0074 | [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | | 0075 | [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md) | `数组`,`双指针`,`排序` | 中等 | | @@ -1493,7 +1493,7 @@ | 1480 | [一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) | `数组`,`前缀和` | 简单 | 第 193 场周赛 | | 1481 | [不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序` | 中等 | 第 193 场周赛 | | 1482 | [制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) | `数组`,`二分查找` | 中等 | 第 193 场周赛 | -| 1483 | [树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二分查找`,`动态规划` | 困难 | 第 193 场周赛 | +| 1483 | [树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二分查找` | 困难 | 第 193 场周赛 | | 1484 | [按日期分组销售产品](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md) | `数据库` | 简单 | | | 1485 | [克隆含随机指针的二叉树](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | | 1486 | [数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) | `位运算`,`数学` | 简单 | 第 194 场周赛 | @@ -1660,7 +1660,7 @@ | 1647 | [字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) | `贪心`,`哈希表`,`字符串`,`排序` | 中等 | 第 214 场周赛 | | 1648 | [销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | 第 214 场周赛 | | 1649 | [通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 214 场周赛 | -| 1650 | [二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md) | `树`,`哈希表`,`双指针`,`二叉树` | 中等 | 🔒 | +| 1650 | [二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md) | `树`,`哈希表`,`二叉树` | 中等 | 🔒 | | 1651 | [Hopper 公司查询 III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md) | `数据库` | 困难 | 🔒 | | 1652 | [拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) | `数组` | 简单 | 第 39 场双周赛 | | 1653 | [使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) | `栈`,`字符串`,`动态规划` | 中等 | 第 39 场双周赛 | @@ -1686,7 +1686,7 @@ | 1673 | [找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) | `栈`,`贪心`,`数组`,`单调栈` | 中等 | 第 217 场周赛 | | 1674 | [使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 217 场周赛 | | 1675 | [数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) | `贪心`,`数组`,`有序集合`,`堆（优先队列）` | 困难 | 第 217 场周赛 | -| 1676 | [二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 1676 | [二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | | 1677 | [发票中的产品金额](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md) | `数据库` | 简单 | 🔒 | | 1678 | [设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) | `字符串` | 简单 | 第 218 场周赛 | | 1679 | [K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 中等 | 第 218 场周赛 | @@ -2642,7 +2642,7 @@ | 2629 | [复合函数](/solution/2600-2699/2629.Function%20Composition/README.md) | | 简单 | | | 2630 | [记忆函数 II](/solution/2600-2699/2630.Memoize%20II/README.md) | | 困难 | | | 2631 | [分组](/solution/2600-2699/2631.Group%20By/README.md) | | 中等 | | -| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 中等 | 🔒 | +| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 困难 | 🔒 | | 2633 | [将对象转换为 JSON 字符串](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md) | | 中等 | 🔒 | | 2634 | [过滤数组中的元素](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README.md) | | 简单 | | | 2635 | [转换数组中的每个元素](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README.md) | | 简单 | | @@ -2922,17 +2922,21 @@ | 2909 | [元素和最小的山形三元组 II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README.md) | `数组` | 中等 | 第 368 场周赛 | | 2910 | [合法分组的最少组数](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 368 场周赛 | | 2911 | [得到 K 个半回文串的最少修改次数](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README.md) | `双指针`,`字符串`,`动态规划` | 困难 | 第 368 场周赛 | -| 2912 | [在网格上移动到目的地的方法数](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 🔒 | -| 2913 | [子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) | `数组`,`哈希表` | 简单 | 第 116 场双周赛 | -| 2914 | [使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) | `贪心`,`字符串` | 中等 | 第 116 场双周赛 | -| 2915 | [和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) | `数组`,`动态规划` | 中等 | 第 116 场双周赛 | -| 2916 | [子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) | `树状数组`,`线段树`,`数组`,`动态规划` | 困难 | 第 116 场双周赛 | -| 2917 | [找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) | `位运算`,`数组` | 简单 | 第 369 场周赛 | -| 2918 | [数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) | `贪心`,`数组` | 中等 | 第 369 场周赛 | -| 2919 | [使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) | `数组`,`动态规划` | 中等 | 第 369 场周赛 | -| 2920 | [收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) | `位运算`,`树`,`深度优先搜索`,`数组`,`动态规划` | 困难 | 第 369 场周赛 | +| 2912 | [在网格上移动到目的地的方法数](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README.md) | | 困难 | 🔒 | +| 2913 | [子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) | | 简单 | 第 116 场双周赛 | +| 2914 | [使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) | | 中等 | 第 116 场双周赛 | +| 2915 | [和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) | | 中等 | 第 116 场双周赛 | +| 2916 | [子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) | | 困难 | 第 116 场双周赛 | +| 2917 | [找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) | | 简单 | 第 369 场周赛 | +| 2918 | [数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) | | 中等 | 第 369 场周赛 | +| 2919 | [使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) | | 中等 | 第 369 场周赛 | +| 2920 | [收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) | | 困难 | 第 369 场周赛 | | 2921 | [Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README.md) | | 困难 | 🔒 | | 2922 | [Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README.md) | | 中等 | 🔒 | +| 2923 | [找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) | | 简单 | 第 370 场周赛 | +| 2924 | [找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) | | 中等 | 第 370 场周赛 | +| 2925 | [在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) | | 中等 | 第 370 场周赛 | +| 2926 | [平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) | | 困难 | 第 370 场周赛 | ## 版权 diff --git a/solution/README_EN.md b/solution/README_EN.md index 591eef1bb816f..f0ff03da0eabd 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -80,7 +80,7 @@ Press Control + F(or Command + F on | 0069 | [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md) | `Math`,`Binary Search` | Easy | | | 0070 | [Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | | | 0071 | [Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README_EN.md) | `Stack`,`String` | Medium | | -| 0072 | [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0072 | [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) | `String`,`Dynamic Programming` | Hard | | | 0073 | [Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | | | 0074 | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | | 0075 | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | @@ -1491,7 +1491,7 @@ Press Control + F(or Command + F on | 1480 | [Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 193 | | 1481 | [Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 193 | | 1482 | [Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 193 | -| 1483 | [Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 193 | +| 1483 | [Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search` | Hard | Weekly Contest 193 | | 1484 | [Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README_EN.md) | `Database` | Easy | | | 1485 | [Clone Binary Tree With Random Pointer](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | | 1486 | [XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Weekly Contest 194 | @@ -1658,7 +1658,7 @@ Press Control + F(or Command + F on | 1647 | [Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 214 | | 1648 | [Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 214 | | 1649 | [Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Weekly Contest 214 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md) | `Tree`,`Hash Table`,`Two Pointers`,`Binary Tree` | Medium | 🔒 | +| 1650 | [Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md) | `Tree`,`Hash Table`,`Binary Tree` | Medium | 🔒 | | 1651 | [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md) | `Database` | Hard | 🔒 | | 1652 | [Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) | `Array` | Easy | Biweekly Contest 39 | | 1653 | [Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 39 | @@ -1684,7 +1684,7 @@ Press Control + F(or Command + F on | 1673 | [Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 217 | | 1674 | [Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 217 | | 1675 | [Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 217 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 1676 | [Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | | 1677 | [Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md) | `Database` | Easy | 🔒 | | 1678 | [Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) | `String` | Easy | Weekly Contest 218 | | 1679 | [Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 218 | @@ -2640,7 +2640,7 @@ Press Control + F(or Command + F on | 2629 | [Function Composition](/solution/2600-2699/2629.Function%20Composition/README_EN.md) | | Easy | | | 2630 | [Memoize II](/solution/2600-2699/2630.Memoize%20II/README_EN.md) | | Hard | | | 2631 | [Group By](/solution/2600-2699/2631.Group%20By/README_EN.md) | | Medium | | -| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Medium | 🔒 | +| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Hard | 🔒 | | 2633 | [Convert Object to JSON String](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) | | Medium | 🔒 | | 2634 | [Filter Elements from Array](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README_EN.md) | | Easy | | | 2635 | [Apply Transform Over Each Element in Array](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README_EN.md) | | Easy | | @@ -2920,17 +2920,21 @@ Press Control + F(or Command + F on | 2909 | [Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) | `Array` | Medium | Weekly Contest 368 | | 2910 | [Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 368 | | 2911 | [Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 368 | -| 2912 | [Number of Ways to Reach Destination in the Grid](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | 🔒 | -| 2913 | [Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 116 | -| 2914 | [Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 116 | -| 2915 | [Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 116 | -| 2916 | [Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 116 | -| 2917 | [Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 369 | -| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 369 | -| 2919 | [Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 369 | -| 2920 | [Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 369 | +| 2912 | [Number of Ways to Reach Destination in the Grid](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) | | Hard | 🔒 | +| 2913 | [Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) | | Easy | Biweekly Contest 116 | +| 2914 | [Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) | | Medium | Biweekly Contest 116 | +| 2915 | [Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) | | Medium | Biweekly Contest 116 | +| 2916 | [Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) | | Hard | Biweekly Contest 116 | +| 2917 | [Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) | | Easy | Weekly Contest 369 | +| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) | | Medium | Weekly Contest 369 | +| 2919 | [Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) | | Medium | Weekly Contest 369 | +| 2920 | [Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) | | Hard | Weekly Contest 369 | | 2921 | [Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) | | Hard | 🔒 | | 2922 | [Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) | | Medium | 🔒 | +| 2923 | [Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) | | Easy | Weekly Contest 370 | +| 2924 | [Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) | | Medium | Weekly Contest 370 | +| 2925 | [Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) | | Medium | Weekly Contest 370 | +| 2926 | [Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) | | Hard | Weekly Contest 370 | ## Copyright diff --git a/solution/summary.md b/solution/summary.md index ef1ac436a2e83..6bb53362a86e9 100644 --- a/solution/summary.md +++ b/solution/summary.md @@ -2980,3 +2980,7 @@ - [2920.收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) - [2921.Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README.md) - [2922.Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README.md) + - [2923.找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) + - [2924.找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) + - [2925.在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) + - [2926.平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) diff --git a/solution/summary_en.md b/solution/summary_en.md index 7c257e7be933e..a71aa30f7215c 100644 --- a/solution/summary_en.md +++ b/solution/summary_en.md @@ -2980,3 +2980,7 @@ - [2920.Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) - [2921.Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) - [2922.Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) + - [2923.Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) + - [2924.Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) + - [2925.Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) + - [2926.Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md)