+
s 和一个整数 k 。你可以选择字符串中的任一字符，并将其更改为任何其他大写英文字符。该操作最多可执行 k 次。
-在执行上述操作后，返回包含相同字母的最长子字符串的长度。
+在执行上述操作后，返回 包含相同字母的最长子字符串的长度。
diff --git a/solution/0400-0499/0424.Longest Repeating Character Replacement/README_EN.md b/solution/0400-0499/0424.Longest Repeating Character Replacement/README_EN.md index e4a4e6134b828..0ac68e949ab2b 100644 --- a/solution/0400-0499/0424.Longest Repeating Character Replacement/README_EN.md +++ b/solution/0400-0499/0424.Longest Repeating Character Replacement/README_EN.md @@ -24,7 +24,7 @@ Output: 4 Explanation: Replace the one 'A' in the middle with 'B' and form "AABBBBA". The substring "BBBB" has the longest repeating letters, which is 4. -There may exists other ways to achive this answer too. +There may exists other ways to achieve this answer too.
Constraints:
diff --git a/solution/0400-0499/0472.Concatenated Words/README.md b/solution/0400-0499/0472.Concatenated Words/README.md index b504a2a74fa86..0f539a98f9da7 100644 --- a/solution/0400-0499/0472.Concatenated Words/README.md +++ b/solution/0400-0499/0472.Concatenated Words/README.md @@ -35,8 +35,8 @@1 <= words.length <= 1041 <= words[i].length <= 30
- words[i]仅由小写英文字母组成。
- -
words中的所有字符串都是 唯一 的。
+ words[i]仅由小写英文字母组成。
+ words中的所有字符串都是 唯一 的。1 <= sum(words[i].length) <= 105
Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.
A concatenated word is defined as a string that is comprised entirely of at least two shorter words (not necesssarily distinct) in the given array.
+A concatenated word is defined as a string that is comprised entirely of at least two shorter words (not necessarily distinct) in the given array.
Example 1:
diff --git a/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md b/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md index 486449ad0d92a..6be746334bf5a 100644 --- a/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md +++ b/solution/0700-0799/0747.Largest Number At Least Twice of Others/README.md @@ -25,14 +25,7 @@输入：nums = [1,2,3,4] 输出：-1 -解释：4 没有超过 3 的两倍大，所以返回 -1 。- -
示例 3：
- --输入：nums = [1] -输出：0 -解释：因为不存在其他数字，所以认为现有数字 1 至少是其他数字的两倍。 +解释：4 没有超过 3 的两倍大，所以返回 -1 。
@@ -40,7 +33,7 @@
提示：
-
-
1 <= nums.length <= 50
+ 2 <= nums.length <= 500 <= nums[i] <= 100nums中的最大元素是唯一的
TimeMap()初始化数据结构对象
- void set(String key, String value, int timestamp)存储键key、值value，以及给定的时间戳timestamp。
- String get(String key, int timestamp)--
-
- 返回先前调用
set(key, value, timestamp_prev)所存储的值，其中timestamp_prev <= timestamp。
- - 如果有多个这样的值，则返回对应最大的
timestamp_prev的那个值。
- - 如果没有值，则返回空字符串（
""）。
-
+ - 返回先前调用
void set(String key, String value, int timestamp)存储给定时间戳timestamp时的键key和值value。
+ String get(String key, int timestamp)返回一个值，该值在之前调用了set，其中timestamp_prev <= timestamp。如果有多个这样的值，它将返回与最大timestamp_prev关联的值。如果没有值，则返回空字符串（""）。
示例：
+示例 1：
输入：
@@ -34,24 +28,24 @@
解释：
TimeMap timeMap = new TimeMap();
-timeMap.set("foo", "bar", 1); // 存储键 "foo" 和值 "bar" ，时间戳 timestamp = 1
+timeMap.set("foo", "bar", 1); // 存储键 "foo" 和值 "bar" ，时间戳 timestamp = 1
timeMap.get("foo", 1); // 返回 "bar"
timeMap.get("foo", 3); // 返回 "bar", 因为在时间戳 3 和时间戳 2 处没有对应 "foo" 的值，所以唯一的值位于时间戳 1 处（即 "bar"） 。
-timeMap.set("foo", "bar2", 4); // 存储键 "foo" 和值 "bar2" ，时间戳 timestamp = 4
+timeMap.set("foo", "bar2", 4); // 存储键 "foo" 和值 "bar2" ，时间戳 timestamp = 4
timeMap.get("foo", 4); // 返回 "bar2"
timeMap.get("foo", 5); // 返回 "bar2"
-+
提示：
-
-
1 <= key.length, value.length <= 100
+ 1 <= key.length, value.length <= 100key和value由小写英文字母和数字组成
- 1 <= timestamp <= 107
+ 1 <= timestamp <= 107set操作中的时间戳timestamp都是严格递增的
- - 最多调用
set和get操作2 * 105次
+ - 最多调用
set和get操作2 * 105次
表: Items
-
编写解决方案找出每一个用户按日期顺序卖出的第二件商品的品牌是否是他们最喜爱的品牌。如果一个用户卖出少于两件商品，查询的结果是 no 。题目保证没有一个用户在一天中卖出超过一件商品。
编写一个解决方案，查找每个用户的加入日期和作为买家在 2019 年下的订单数。
以 任意顺序 返回结果表
+以 任意顺序 返回结果表。
-返回结果格式的例子如下所示：
+返回结果格式如下例所示：
@@ -103,7 +103,7 @@ Items table: +-----------+--------------------+ 解释： id 为 1 的用户的查询结果是 no，因为他什么也没有卖出 -id为 2 和 3 的用户的查询结果是 yes，因为他们卖出的第二件商品的品牌是他们自己最喜爱的品牌 +id为 2 和 3 的用户的查询结果是 yes，因为他们卖出的第二件商品的品牌是他们最喜爱的品牌 id为 4 的用户的查询结果是 no，因为他卖出的第二件商品的品牌不是他最喜爱的品牌 diff --git a/solution/1300-1399/1349.Maximum Students Taking Exam/README.md b/solution/1300-1399/1349.Maximum Students Taking Exam/README.md index 94806d650d097..d4b48951a9382 100644 --- a/solution/1300-1399/1349.Maximum Students Taking Exam/README.md +++ b/solution/1300-1399/1349.Maximum Students Taking Exam/README.md @@ -6,9 +6,9 @@ -
给你一个 m * n 的矩阵 seats 表示教室中的座位分布。如果座位是坏的（不可用），就用 '#' 表示；否则，用 '.' 表示。
给你一个 m * n 的矩阵 seats 表示教室中的座位分布。如果座位是坏的（不可用），就用 '#' 表示；否则，用 '.' 表示。
学生可以看到左侧、右侧、左上、右上这四个方向上紧邻他的学生的答卷，但是看不到直接坐在他前面或者后面的学生的答卷。请你计算并返回该考场可以容纳的一起参加考试且无法作弊的最大学生人数。
+学生可以看到左侧、右侧、左上、右上这四个方向上紧邻他的学生的答卷，但是看不到直接坐在他前面或者后面的学生的答卷。请你计算并返回该考场可以容纳的同时参加考试且无法作弊的 最大 学生人数。
学生必须坐在状况良好的座位上。
@@ -16,33 +16,36 @@示例 1：
-
输入：seats = [["#",".","#","#",".","#"], - [".","#","#","#","#","."], - ["#",".","#","#",".","#"]] ++输入：seats = [["#",".","#","#",".","#"], + [".","#","#","#","#","."], + ["#",".","#","#",".","#"]] 输出：4 解释：教师可以让 4 个学生坐在可用的座位上，这样他们就无法在考试中作弊。示例 2：
-输入：seats = [[".","#"], - ["#","#"], - ["#","."], - ["#","#"], - [".","#"]] ++输入：seats = [[".","#"], + ["#","#"], + ["#","."], + ["#","#"], + [".","#"]] 输出：3 解释：让所有学生坐在可用的座位上。示例 3：
-输入：seats = [["#",".",".",".","#"], - [".","#",".","#","."], - [".",".","#",".","."], - [".","#",".","#","."], - ["#",".",".",".","#"]] ++输入：seats = [["#",".",".",".","#"], + [".","#",".","#","."], + [".",".","#",".","."], + [".","#",".","#","."], + ["#",".",".",".","#"]] 输出：10 解释：让学生坐在第 1、3 和 5 列的可用座位上。@@ -52,7 +55,7 @@提示：
-
-
seats只包含字符'.' 和'#'
+ seats只包含字符'.' 和'#'m == seats.lengthn == seats[i].length1 <= m <= 8
diff --git a/solution/1300-1399/1359.Count All Valid Pickup and Delivery Options/README_EN.md b/solution/1300-1399/1359.Count All Valid Pickup and Delivery Options/README_EN.md
index 57109e4855d64..71a362ba6ac7a 100644
--- a/solution/1300-1399/1359.Count All Valid Pickup and Delivery Options/README_EN.md
+++ b/solution/1300-1399/1359.Count All Valid Pickup and Delivery Options/README_EN.md
@@ -4,7 +4,7 @@
## Description
-
Given n orders,each order consists of a pickup and a delivery service.
Given n orders, each order consists of a pickup and a delivery service.
Count all valid pickup/delivery possible sequences such that delivery(i) is always after of pickup(i).
diff --git a/solution/1400-1499/1402.Reducing Dishes/README.md b/solution/1400-1499/1402.Reducing Dishes/README.md index 7d1f79e250e4f..ad70d8251b085 100644 --- a/solution/1400-1499/1402.Reducing Dishes/README.md +++ b/solution/1400-1499/1402.Reducing Dishes/README.md @@ -8,9 +8,9 @@一个厨师收集了他 n 道菜的满意程度 satisfaction ，这个厨师做出每道菜的时间都是 1 单位时间。
一道菜的 「喜爱时间」系数定义为烹饪这道菜以及之前每道菜所花费的时间乘以这道菜的满意程度，也就是 time[i]*satisfaction[i] 。
一道菜的 「 like-time 系数 」定义为烹饪这道菜结束的时间（包含之前每道菜所花费的时间）乘以这道菜的满意程度，也就是 time[i]*satisfaction[i] 。
请你返回做完所有菜 「喜爱时间」总和的最大值为多少。
+返回厨师在准备了一定数量的菜肴后可以获得的最大 like-time 系数 总和。
你可以按 任意 顺序安排做菜的顺序，你也可以选择放弃做某些菜来获得更大的总和。
@@ -21,14 +21,14 @@输入：satisfaction = [-1,-8,0,5,-9] 输出：14 -解释：去掉第二道和最后一道菜，最大的喜爱时间系数和为 (-1*1 + 0*2 + 5*3 = 14) 。每道菜都需要花费 1 单位时间完成。+解释：去掉第二道和最后一道菜，最大的 like-time 系数和为 (-1*1 + 0*2 + 5*3 = 14) 。每道菜都需要花费 1 单位时间完成。
示例 2：
输入：satisfaction = [4,3,2] 输出：20 -解释：按照原来顺序相反的时间做菜 (2*1 + 3*2 + 4*3 = 20) +解释：可以按照任意顺序做菜 (2*1 + 3*2 + 4*3 = 20)
示例 3：
@@ -36,7 +36,7 @@输入：satisfaction = [-1,-4,-5] 输出：0 -解释：大家都不喜欢这些菜，所以不做任何菜可以获得最大的喜爱时间系数。 +解释：大家都不喜欢这些菜，所以不做任何菜就可以获得最大的 like-time 系数。
diff --git a/solution/1400-1499/1402.Reducing Dishes/README_EN.md b/solution/1400-1499/1402.Reducing Dishes/README_EN.md index 746f6076a7936..e3da455ca2d96 100644 --- a/solution/1400-1499/1402.Reducing Dishes/README_EN.md +++ b/solution/1400-1499/1402.Reducing Dishes/README_EN.md @@ -8,7 +8,7 @@
Like-time coefficient of a dish is defined as the time taken to cook that dish including previous dishes multiplied by its satisfaction level i.e. time[i] * satisfaction[i].
Return the maximum sum of like-time coefficient that the chef can obtain after dishes preparation.
+Return the maximum sum of like-time coefficient that the chef can obtain after preparing some amount of dishes.
Dishes can be prepared in any order and the chef can discard some dishes to get this maximum value.
diff --git a/solution/1500-1599/1537.Get the Maximum Score/README.md b/solution/1500-1599/1537.Get the Maximum Score/README.md index 8fc2fcecbb224..8d2c453615bfa 100644 --- a/solution/1500-1599/1537.Get the Maximum Score/README.md +++ b/solution/1500-1599/1537.Get the Maximum Score/README.md @@ -11,24 +11,23 @@一条 合法路径 定义如下：
-
-
- 选择数组 nums1 或者 nums2 开始遍历（从下标 0 处开始）。 +
- 选择数组
nums1或者nums2开始遍历（从下标 0 处开始）。 - 从左到右遍历当前数组。
- 如果你遇到了
nums1和nums2中都存在的值，那么你可以切换路径到另一个数组对应数字处继续遍历（但在合法路径中重复数字只会被统计一次）。
得分定义为合法路径中不同数字的和。
+得分 定义为合法路径中不同数字的和。
-请你返回所有可能合法路径中的最大得分。
- -由于答案可能很大，请你将它对 10^9 + 7 取余后返回。
+请你返回 所有可能 合法路径 中的最大得分。由于答案可能很大，请你将它对 10^9 + 7 取余后返回。
示例 1：
-
输入：nums1 = [2,4,5,8,10], nums2 = [4,6,8,9] ++输入：nums1 = [2,4,5,8,10], nums2 = [4,6,8,9] 输出：30 解释：合法路径包括： [2,4,5,8,10], [2,4,5,8,9], [2,4,6,8,9], [2,4,6,8,10],（从 nums1 开始遍历） @@ -38,23 +37,19 @@示例 2：
-输入：nums1 = [1,3,5,7,9], nums2 = [3,5,100] ++输入：nums1 = [1,3,5,7,9], nums2 = [3,5,100] 输出：109 解释：最大得分由路径 [1,3,5,100] 得到。示例 3：
-输入：nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10] ++输入：nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10] 输出：40 解释：nums1 和 nums2 之间无相同数字。 -最大得分由路径 [6,7,8,9,10] 得到。 -- -示例 4：
- -输入：nums1 = [1,4,5,8,9,11,19], nums2 = [2,3,4,11,12] -输出：61 +最大得分由路径[6,7,8,9,10]得到。@@ -62,9 +57,8 @@
提示：
-
-
1 <= nums1.length <= 10^5
- 1 <= nums2.length <= 10^5
- 1 <= nums1[i], nums2[i] <= 10^7
+ 1 <= nums1.length, nums2.length <= 105
+ 1 <= nums1[i], nums2[i] <= 107nums1和nums2都是严格递增的数组。
You are given two sorted arrays of distinct integers nums1 and nums2.
You are given two sorted arrays of distinct integers nums1 and nums2.
A valid path is defined as follows:
@@ -14,7 +14,7 @@nums1 and nums2 you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path).The score is defined as the sum of uniques values in a valid path.
+The score is defined as the sum of unique values in a valid path.
Return the maximum score you can obtain of all possible valid paths. Since the answer may be too large, return it modulo 109 + 7.
The monsters walk toward the city at a constant speed. The speed of each monster is given to you in an integer array speed of size n, where speed[i] is the speed of the ith monster in kilometers per minute.
You have a weapon that, once fully charged, can eliminate a single monster. However, the weapon takes one minute to charge.The weapon is fully charged at the very start.
+You have a weapon that, once fully charged, can eliminate a single monster. However, the weapon takes one minute to charge. The weapon is fully charged at the very start.
You lose when any monster reaches your city. If a monster reaches the city at the exact moment the weapon is fully charged, it counts as a loss, and the game ends before you can use your weapon.
diff --git a/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README.md b/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README.md index 5cf3f0898b1df..187b0e22693c8 100644 --- a/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README.md +++ b/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README.md @@ -21,14 +21,16 @@示例 1：
-输入：word = "abcc" ++输入：word = "abcc" 输出：true -解释：选择下标 3 并删除该字母，word 变成 "abc" 且每个字母出现频率都为 1 。 +解释：选择下标 3 并删除该字母：word 变成 "abc" 且每个字母出现频率都为 1 。示例 2：
-输入：word = "aazz" ++输入：word = "aazz" 输出：false 解释：我们必须删除一个字母，所以要么 "a" 的频率变为 1 且 "z" 的频率为 2 ，要么两个字母频率反过来。所以不可能让剩余所有字母出现频率相同。diff --git a/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README_EN.md b/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README_EN.md index cad9c2a5b407e..7721efc701e67 100644 --- a/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README_EN.md +++ b/solution/2400-2499/2423.Remove Letter To Equalize Frequency/README_EN.md @@ -12,7 +12,7 @@
- The frequency of a letter
xis the number of times it occurs in the string.
- - You must remove exactly one letter and cannot chose to do nothing. +
- You must remove exactly one letter and cannot choose to do nothing.
diff --git a/solution/2500-2599/2530.Maximal Score After Applying K Operations/README.md b/solution/2500-2599/2530.Maximal Score After Applying K Operations/README.md index 68e45b347fb35..2cdaa9c040a03 100644 --- a/solution/2500-2599/2530.Maximal Score After Applying K Operations/README.md +++ b/solution/2500-2599/2530.Maximal Score After Applying K Operations/README.md @@ -38,7 +38,7 @@ 解释：可以执行下述操作： 第 1 步操作：选中 i = 1 ，nums 变为 [1,4,3,3,3] 。分数增加 10 。 第 2 步操作：选中 i = 1 ，nums 变为 [1,2,3,3,3] 。分数增加 4 。 -第 3 步操作：选中 i = 2 ，nums 变为 [1,1,1,3,3] 。分数增加 3 。 +第 3 步操作：选中 i = 2 ，nums 变为 [1,2,1,3,3] 。分数增加 3 。 最后分数是 10 + 4 + 3 = 17 。 diff --git a/solution/2600-2699/2668.Find Latest Salaries/README.md b/solution/2600-2699/2668.Find Latest Salaries/README.md index 4f23dda117c38..661a5b93997ff 100644 --- a/solution/2600-2699/2668.Find Latest Salaries/README.md +++ b/solution/2600-2699/2668.Find Latest Salaries/README.md @@ -63,7 +63,7 @@ 解释： - emp_id 1 有两条记录，工资分别为 110000 和 106119，其中 110000 是更新后的工资（假设工资每年都会增加） -- emp_id 2 有两条记录，工资分别为 128922 和 128922，其中 130000 是更新后的工资。 +- emp_id 2 有两条记录，工资分别为 128922 和 130000，其中 130000 是更新后的工资。 - emp_id 3 只有一条工资记录，因此这已经是更新后的工资。 - emp_id 4 有两条记录，工资分别为 162825 和 170000，其中 170000 是更新后的工资。 - emp_id 5 只有一条工资记录，因此这已经是更新后的工资。 diff --git a/solution/2700-2799/2745.Construct the Longest New String/README.md b/solution/2700-2799/2745.Construct the Longest New String/README.md index 5c65af0dfb56a..1f9c26e244df3 100644 --- a/solution/2700-2799/2745.Construct the Longest New String/README.md +++ b/solution/2700-2799/2745.Construct the Longest New String/README.md @@ -10,7 +10,7 @@
这三个整数表示你有 x 个 "AA" 字符串，y 个 "BB" 字符串，和 z 个 "AB" 字符串。你需要选择这些字符串中的部分字符串（可以全部选择也可以一个都不选择），将它们按顺序连接得到一个新的字符串。新字符串不能包含子字符串 "AAA" 或者 "BBB" 。
请你返回新字符串的最大可能长度。
+请你返回 新字符串的最大可能长度。
子字符串 是一个字符串中一段连续 非空 的字符序列。
diff --git a/solution/2700-2799/2745.Construct the Longest New String/README_EN.md b/solution/2700-2799/2745.Construct the Longest New String/README_EN.md index a078febe955df..b64647a94a68a 100644 --- a/solution/2700-2799/2745.Construct the Longest New String/README_EN.md +++ b/solution/2700-2799/2745.Construct the Longest New String/README_EN.md @@ -6,7 +6,7 @@You are given three integers x, y, and z.
You have x strings equal to "AA", y strings equal to "BB", and z strings equal to "AB". You want to choose some (possibly all or none) of these strings and concactenate them in some order to form a new string. This new string must not contain "AAA" or "BBB" as a substring.
You have x strings equal to "AA", y strings equal to "BB", and z strings equal to "AB". You want to choose some (possibly all or none) of these strings and concatenate them in some order to form a new string. This new string must not contain "AAA" or "BBB" as a substring.
Return the maximum possible length of the new string.
diff --git a/solution/2700-2799/2773.Height of Special Binary Tree/README.md b/solution/2700-2799/2773.Height of Special Binary Tree/README.md index a32fa2fdfa857..26e9397c2c553 100644 --- a/solution/2700-2799/2773.Height of Special Binary Tree/README.md +++ b/solution/2700-2799/2773.Height of Special Binary Tree/README.md @@ -11,8 +11,8 @@这棵树的叶子节点有一个 特殊 属性 ！对于每个叶子节点 bi ，满足以下条件：
-
-
- 如果
i < k，则bi的右子节点为bi + 1；否则为b1。
- - 如果
i > 1，则bi的左子节点为bi - 1；否则为bk。
+ - 如果
i < k，则bi的右子节点为bi + 1；否则为b1。
+ - 如果
i > 1，则bi的左子节点为bi - 1；否则为bk。
返回给定树的高度。
diff --git a/solution/2800-2899/2883.Drop Missing Data/README.md b/solution/2800-2899/2883.Drop Missing Data/README.md index c8e58e06cb506..fc5d8b0d98ed6 100644 --- a/solution/2800-2899/2883.Drop Missing Data/README.md +++ b/solution/2800-2899/2883.Drop Missing Data/README.md @@ -29,23 +29,24 @@ DataFrame students输入： -+------------+-------+-----+ -| student_id | name | age | -+------------+-------+-----+ -| 32 | Piper | 5 | -| 217 | Grace | 19 | -| 779 | None | 20 | -| 849 | None | 14 | -+------------+-------+-----+ ++------------+---------+-----+ +| student_id | name | age | ++------------+---------+-----+ +| 32 | Piper | 5 | +| 217 | None | 19 | +| 779 | Georgia | 20 | +| 849 | Willow | 14 | ++------------+---------+-----+ 输出： -+------------+-------+-----+ -| student_id | name | age | -+------------+-------+-----+ -| 32 | Piper | 5 | -| 217 | Grace | 19 | -+------------+-------+-----+ ++------------+---------+-----+ +| student_id | name | age | ++------------+---------+-----+ +| 32 | Piper | 5 | +| 779 | Georgia | 20 | +| 849 | Willow | 14 | ++------------+---------+-----+ 解释： -学号为 779 和 849 的学生所在行在 name 列中有空值，因此它们将被删除。+学号为 217 的学生所在行在 name 列中有空值，因此这一行将被删除。 ## 解法 diff --git a/solution/2800-2899/2883.Drop Missing Data/README_EN.md b/solution/2800-2899/2883.Drop Missing Data/README_EN.md index f0481df6d2025..19d0d6e75d6f8 100644 --- a/solution/2800-2899/2883.Drop Missing Data/README_EN.md +++ b/solution/2800-2899/2883.Drop Missing Data/README_EN.md @@ -26,23 +26,24 @@ DataFrame students
Input: -+------------+-------+-----+ -| student_id | name | age | -+------------+-------+-----+ -| 32 | Piper | 5 | -| 217 | Grace | 19 | -| 779 | None | 20 | -| 849 | None | 14 | -+------------+-------+-----+ ++------------+---------+-----+ +| student_id | name | age | ++------------+---------+-----+ +| 32 | Piper | 5 | +| 217 | None | 19 | +| 779 | Georgia | 20 | +| 849 | Willow | 14 | ++------------+---------+-----+ Output: -+------------+-------+-----+ -| student_id | name | age | -+------------+-------+-----+ -| 32 | Piper | 5 | -| 217 | Grace | 19 | -+------------+-------+-----+ ++------------+---------+-----+ +| student_id | name | age | ++------------+---------+-----+ +| 32 | Piper | 5 | +| 779 | Georgia | 20 | +| 849 | Willow | 14 | ++------------+---------+-----+ Explanation: -Students with ids 779 and 849 have empty values in the name column, so they will be removed.+Student with id 217 havs empty value in the name column, so it will be removed. ## Solutions diff --git a/solution/2800-2899/2887.Fill Missing Data/README_EN.md b/solution/2800-2899/2887.Fill Missing Data/README_EN.md index 06232f29cd876..9ad804db4c71f 100644 --- a/solution/2800-2899/2887.Fill Missing Data/README_EN.md +++ b/solution/2800-2899/2887.Fill Missing Data/README_EN.md @@ -25,22 +25,22 @@ DataFrame
products
Input:+-----------------+----------+-------+
| name | quantity | price |
+-----------------+----------+-------+
-| Wristwatch | 32 | 135 |
+| Wristwatch | None | 135 |
| WirelessEarbuds | None | 821 |
-| GolfClubs | None | 9319 |
+| GolfClubs | 779 | 9319 |
| Printer | 849 | 3051 |
+-----------------+----------+-------+
Output:
+-----------------+----------+-------+
| name | quantity | price |
+-----------------+----------+-------+
-| Wristwatch | 32 | 135 |
+| Wristwatch | 0 | 135 |
| WirelessEarbuds | 0 | 821 |
-| GolfClubs | 0 | 9319 |
+| GolfClubs | 779 | 9319 |
| Printer | 849 | 3051 |
+-----------------+----------+-------+
Explanation:
-The quantity for Toaster and Headphones are filled by 0.
+The quantity for Wristwatch and WirelessEarbuds are filled by 0.
## Solutions
diff --git a/solution/2800-2899/2890.Reshape Data Melt/README.md b/solution/2800-2899/2890.Reshape Data Melt/README.md
index 82ca982935c38..6bed21d0ed64f 100644
--- a/solution/2800-2899/2890.Reshape Data Melt/README.md
+++ b/solution/2800-2899/2890.Reshape Data Melt/README.md
@@ -35,7 +35,7 @@ DataFrame report
| Umbrella | 417 | 224 | 379 | 611 |
| SleepingBag | 800 | 936 | 93 | 875 |
+-------------+-----------+-----------+-----------+-----------+
-输出：
+输出：
+-------------+-----------+-------+
| product | quarter | sales |
+-------------+-----------+-------+
@@ -48,7 +48,7 @@ DataFrame report
| Umbrella | quarter_4 | 611 |
| SleepingBag | quarter_4 | 875 |
+-------------+-----------+-------+
-解释：
+解释：
DataFrame 已从宽格式重塑为长格式。每一行表示一个季度内产品的销售情况。
diff --git a/solution/2800-2899/2898.Maximum Linear Stock Score/README.md b/solution/2800-2899/2898.Maximum Linear Stock Score/README.md
index 9c7ddfe596cf9..b63071d116e87 100644
--- a/solution/2800-2899/2898.Maximum Linear Stock Score/README.md
+++ b/solution/2800-2899/2898.Maximum Linear Stock Score/README.md
@@ -1,4 +1,4 @@
-# [2898. Maximum Linear Stock Score](https://leetcode.cn/problems/maximum-linear-stock-score)
+# [2898. 最大线性股票得分](https://leetcode.cn/problems/maximum-linear-stock-score)
[English Version](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md)
@@ -6,47 +6,49 @@
-Given a 1-indexed integer array prices, where prices[i] is the price of a particular stock on the ith day, your task is to select some of the elements of prices such that your selection is linear.
给定一个 1-indexed 整数数组 prices，其中 prices[i] 是第 i 天某只股票的价格。你的任务是 线性 地选择 prices 中的一些元素。
A selection indexes, where indexes is a 1-indexed integer array of length k which is a subsequence of the array [1, 2, ..., n], is linear if:
一个选择 indexes，其中 indexes 是一个 1-indexed 整数数组，长度为 k，是数组 [1, 2, ..., n] 的子序列，如果以下条件成立，那么它是 线性 的：
-
-
- For every
1 < j <= k,prices[indexes[j]] - prices[indexes[j - 1]] == indexes[j] - indexes[j - 1].
+ - 对于每个
1 < j <= k，prices[indexes[j]] - prices[indexes[j - 1]] == indexes[j] - indexes[j - 1]。
A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.
+数组的 子序列 是经由原数组删除一些元素（可能不删除）而产生的新数组，且删除不改变其余元素相对顺序。
-The score of a selection indexes, is equal to the sum of the following array: [prices[indexes[1]], prices[indexes[2]], ..., prices[indexes[k]].
选择 indexes 的 得分 等于以下数组的总和：[prices[indexes[1]], prices[indexes[2]], ..., prices[indexes[k]]。
Return the maximum score that a linear selection can have.
+返回 线性选择的 最大得分。
-
Example 1:
+ +示例 1：
-Input: prices = [1,5,3,7,8] -Output: 20 -Explanation: We can select the indexes [2,4,5]. We show that our selection is linear: -For j = 2, we have: -indexes[2] - indexes[1] = 4 - 2 = 2. -prices[4] - prices[2] = 7 - 5 = 2. -For j = 3, we have: -indexes[3] - indexes[2] = 5 - 4 = 1. -prices[5] - prices[4] = 8 - 7 = 1. -The sum of the elements is: prices[2] + prices[4] + prices[5] = 20. -It can be shown that the maximum sum a linear selection can have is 20. +输入： prices = [1,5,3,7,8] +输出： 20 +解释： 我们可以选择索引[2,4,5]。我们可以证明我们的选择是线性的： +对于j = 2，我们有： +indexes[2] - indexes[1] = 4 - 2 = 2。 +prices[4] - prices[2] = 7 - 5 = 2。 +对于j = 3，我们有： +indexes[3] - indexes[2] = 5 - 4 = 1。 +prices[5] - prices[4] = 8 - 7 = 1。 +元素的总和是：prices[2] + prices[4] + prices[5] = 20。 +可以证明线性选择的最大和是20。-
Example 2:
+示例 2：
-Input: prices = [5,6,7,8,9] -Output: 35 -Explanation: We can select all of the indexes [1,2,3,4,5]. Since each element has a difference of exactly 1 from its previous element, our selection is linear. -The sum of all the elements is 35 which is the maximum possible some out of every selection.+输入： prices = [5,6,7,8,9] +输出： 35 +解释： 我们可以选择所有索引[1,2,3,4,5]。因为每个元素与前一个元素的差异恰好为1，所以我们的选择是线性的。 +所有元素的总和是35，这是每个选择的最大可能总和。
-
Constraints:
+ +提示：
1 <= prices.length <= 105
diff --git a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md
index 6bcceeeb527fa..1f013e0b85b49 100644
--- a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md
+++ b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md
@@ -6,7 +6,7 @@
-
给你一个整数 n 和一个下标从 0 开始的字符串数组 words ，和一个下标从 0 开始的 二进制 数组 groups ，两个数组长度都是 n 。
给你一个整数 n 和一个下标从 0 开始的字符串数组 words ，和一个下标从 0 开始的数组 groups ，两个数组长度都是 n 。
两个长度相等字符串的 汉明距离 定义为对应位置字符 不同 的数目。
diff --git a/solution/DATABASE_README.md b/solution/DATABASE_README.md index 3247d9542cfad..87a73ec15b617 100644 --- a/solution/DATABASE_README.md +++ b/solution/DATABASE_README.md @@ -245,7 +245,7 @@ | 2837 | [总旅行距离](/solution/2800-2899/2837.Total%20Traveled%20Distance/README.md) | `数据库` | 简单 | 🔒 | | 2853 | [最高薪水差异](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) | `数据库` | 简单 | 🔒 | | 2854 | [滚动平均步数](/solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) | `数据库` | 中等 | 🔒 | -| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | | 中等 | 🔒 | +| 2893 | [计算每个区间内的订单](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | `数据库` | 中等 | 🔒 | ## 版权 diff --git a/solution/DATABASE_README_EN.md b/solution/DATABASE_README_EN.md index 47be2a14f8813..9ea0768a5145f 100644 --- a/solution/DATABASE_README_EN.md +++ b/solution/DATABASE_README_EN.md @@ -243,7 +243,7 @@ Press Control + F(or Command + F on | 2837 | [Total Traveled Distance](/solution/2800-2899/2837.Total%20Traveled%20Distance/README_EN.md) | `Database` | Easy | 🔒 | | 2853 | [Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) | `Database` | Easy | 🔒 | | 2854 | [Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) | `Database` | Medium | 🔒 | -| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | | Medium | 🔒 | +| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | `Database` | Medium | 🔒 | ## Copyright diff --git a/solution/JAVASCRIPT_README.md b/solution/JAVASCRIPT_README.md index f8d07d4d6c519..37b2eb93a6701 100644 --- a/solution/JAVASCRIPT_README.md +++ b/solution/JAVASCRIPT_README.md @@ -70,7 +70,7 @@ | 2794 | [从两个数组中创建对象](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md) | | 简单 | 🔒 | | 2795 | [并行执行 Promise 以获取独有的结果](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md) | | 中等 | 🔒 | | 2796 | [重复字符串](/solution/2700-2799/2796.Repeat%20String/README.md) | | 简单 | 🔒 | -| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 中等 | 🔒 | +| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 简单 | 🔒 | | 2803 | [阶乘生成器](/solution/2800-2899/2803.Factorial%20Generator/README.md) | | 简单 | 🔒 | | 2804 | [数组原型的 forEach 方法](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md) | | 简单 | 🔒 | | 2805 | [自定义间隔](/solution/2800-2899/2805.Custom%20Interval/README.md) | | 中等 | 🔒 | diff --git a/solution/JAVASCRIPT_README_EN.md b/solution/JAVASCRIPT_README_EN.md index f52785b99c9d9..84361d3bc3554 100644 --- a/solution/JAVASCRIPT_README_EN.md +++ b/solution/JAVASCRIPT_README_EN.md @@ -68,7 +68,7 @@ Press Control + F(or Command + F on | 2794 | [Create Object from Two Arrays](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) | | Easy | 🔒 | | 2795 | [Parallel Execution of Promises for Individual Results Retrieval](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) | | Medium | 🔒 | | 2796 | [Repeat String](/solution/2700-2799/2796.Repeat%20String/README_EN.md) | | Easy | 🔒 | -| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Medium | 🔒 | +| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Easy | 🔒 | | 2803 | [Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md) | | Easy | 🔒 | | 2804 | [Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md) | | Easy | 🔒 | | 2805 | [Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README_EN.md) | | Medium | 🔒 | diff --git a/solution/README.md b/solution/README.md index 501f2d1e0c9e9..4b6263cd92672 100644 --- a/solution/README.md +++ b/solution/README.md @@ -287,14 +287,14 @@ | 0274 | [H 指数](/solution/0200-0299/0274.H-Index/README.md) | `数组`,`计数排序`,`排序` | 中等 | | | 0275 | [H 指数 II](/solution/0200-0299/0275.H-Index%20II/README.md) | `数组`,`二分查找` | 中等 | | | 0276 | [栅栏涂色](/solution/0200-0299/0276.Paint%20Fence/README.md) | `动态规划` | 中等 | 🔒 | -| 0277 | [搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md) | `贪心`,`图`,`双指针`,`交互` | 中等 | 🔒 | +| 0277 | [搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md) | `图`,`双指针`,`交互` | 中等 | 🔒 | | 0278 | [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md) | `二分查找`,`交互` | 简单 | | | 0279 | [完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md) | `广度优先搜索`,`数学`,`动态规划` | 中等 | | | 0280 | [摆动排序](/solution/0200-0299/0280.Wiggle%20Sort/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | | 0281 | [锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md) | `设计`,`队列`,`数组`,`迭代器` | 中等 | 🔒 | | 0282 | [给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md) | `数学`,`字符串`,`回溯` | 困难 | | | 0283 | [移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md) | `数组`,`双指针` | 简单 | | -| 0284 | [顶端迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) | `设计`,`数组`,`迭代器` | 中等 | | +| 0284 | [窥视迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) | `设计`,`数组`,`迭代器` | 中等 | | | 0285 | [二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | 🔒 | | 0286 | [墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | | 0287 | [寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md) | `位运算`,`数组`,`双指针`,`二分查找` | 中等 | | @@ -358,12 +358,12 @@ | 0345 | [反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md) | `双指针`,`字符串` | 简单 | | | 0346 | [数据流中的移动平均值](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md) | `设计`,`队列`,`数组`,`数据流` | 简单 | 🔒 | | 0347 | [前 K 个高频元素](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md) | `数组`,`哈希表`,`分治`,`桶排序`,`计数`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | -| 0348 | [设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md) | `设计`,`数组`,`哈希表`,`矩阵` | 中等 | 🔒 | +| 0348 | [设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md) | `设计`,`数组`,`哈希表`,`矩阵`,`模拟` | 中等 | 🔒 | | 0349 | [两个数组的交集](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | | 0350 | [两个数组的交集 II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | | 0351 | [安卓系统手势解锁](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md) | `动态规划`,`回溯` | 中等 | 🔒 | | 0352 | [将数据流变为多个不相交区间](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md) | `设计`,`二分查找`,`有序集合` | 困难 | | -| 0353 | [贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md) | `设计`,`队列`,`数组`,`矩阵` | 中等 | 🔒 | +| 0353 | [贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md) | `设计`,`队列`,`数组`,`哈希表`,`模拟` | 中等 | 🔒 | | 0354 | [俄罗斯套娃信封问题](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | | | 0355 | [设计推特](/solution/0300-0399/0355.Design%20Twitter/README.md) | `设计`,`哈希表`,`链表`,`堆（优先队列）` | 中等 | | | 0356 | [直线镜像](/solution/0300-0399/0356.Line%20Reflection/README.md) | `数组`,`哈希表`,`数学` | 中等 | 🔒 | @@ -500,7 +500,7 @@ | 0487 | [最大连续1的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 🔒 | | 0488 | [祖玛游戏](/solution/0400-0499/0488.Zuma%20Game/README.md) | `栈`,`广度优先搜索`,`记忆化搜索`,`字符串`,`动态规划` | 困难 | | | 0489 | [扫地机器人](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md) | `回溯`,`交互` | 困难 | 🔒 | -| 0490 | [迷宫](/solution/0400-0499/0490.The%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 🔒 | +| 0490 | [迷宫](/solution/0400-0499/0490.The%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | | 0491 | [递增子序列](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README.md) | `位运算`,`数组`,`哈希表`,`回溯` | 中等 | | | 0492 | [构造矩形](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md) | `数学` | 简单 | | | 0493 | [翻转对](/solution/0400-0499/0493.Reverse%20Pairs/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | @@ -509,13 +509,13 @@ | 0496 | [下一个更大元素 I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md) | `栈`,`数组`,`哈希表`,`单调栈` | 简单 | | | 0497 | [非重叠矩形中的随机点](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md) | `水塘抽样`,`数组`,`数学`,`二分查找`,`有序集合`,`前缀和`,`随机化` | 中等 | | | 0498 | [对角线遍历](/solution/0400-0499/0498.Diagonal%20Traverse/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | -| 0499 | [迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | +| 0499 | [迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`字符串`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | | 0500 | [键盘行](/solution/0500-0599/0500.Keyboard%20Row/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | | 0501 | [二叉搜索树中的众数](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | | 0502 | [IPO](/solution/0500-0599/0502.IPO/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | | | 0503 | [下一个更大元素 II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md) | `栈`,`数组`,`单调栈` | 中等 | | | 0504 | [七进制数](/solution/0500-0599/0504.Base%207/README.md) | `数学` | 简单 | | -| 0505 | [迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | +| 0505 | [迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | | 0506 | [相对名次](/solution/0500-0599/0506.Relative%20Ranks/README.md) | `数组`,`排序`,`堆（优先队列）` | 简单 | | | 0507 | [完美数](/solution/0500-0599/0507.Perfect%20Number/README.md) | `数学` | 简单 | | | 0508 | [出现次数最多的子树元素和](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | | @@ -676,7 +676,7 @@ | 0663 | [均匀树划分](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | | 0664 | [奇怪的打印机](/solution/0600-0699/0664.Strange%20Printer/README.md) | `字符串`,`动态规划` | 困难 | | | 0665 | [非递减数列](/solution/0600-0699/0665.Non-decreasing%20Array/README.md) | `数组` | 中等 | | -| 0666 | [路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md) | `树`,`深度优先搜索`,`数组`,`二叉树` | 中等 | 🔒 | +| 0666 | [路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`二叉树` | 中等 | 🔒 | | 0667 | [优美的排列 II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md) | `数组`,`数学` | 中等 | | | 0668 | [乘法表中第k小的数](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md) | `数学`,`二分查找` | 困难 | | | 0669 | [修剪二叉搜索树](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | @@ -804,7 +804,7 @@ | 0791 | [自定义字符串排序](/solution/0700-0799/0791.Custom%20Sort%20String/README.md) | `哈希表`,`字符串`,`排序` | 中等 | | | 0792 | [匹配子序列的单词数](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`二分查找`,`动态规划`,`排序` | 中等 | | | 0793 | [阶乘函数后 K 个零](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md) | `数学`,`二分查找` | 困难 | | -| 0794 | [有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md) | `数组`,`字符串` | 中等 | | +| 0794 | [有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md) | `数组`,`矩阵` | 中等 | | | 0795 | [区间子数组个数](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md) | `数组`,`双指针` | 中等 | | | 0796 | [旋转字符串](/solution/0700-0799/0796.Rotate%20String/README.md) | `字符串`,`字符串匹配` | 简单 | | | 0797 | [所有可能的路径](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`回溯` | 中等 | | @@ -2807,7 +2807,7 @@ | 2794 | [从两个数组中创建对象](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md) | | 简单 | 🔒 | | 2795 | [并行执行 Promise 以获取独有的结果](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md) | | 中等 | 🔒 | | 2796 | [重复字符串](/solution/2700-2799/2796.Repeat%20String/README.md) | | 简单 | 🔒 | -| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 中等 | 🔒 | +| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 简单 | 🔒 | | 2798 | [满足目标工作时长的员工数目](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md) | `数组`,`枚举` | 简单 | 第 356 场周赛 | | 2799 | [统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 356 场周赛 | | 2800 | [包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md) | `贪心`,`字符串`,`枚举` | 中等 | 第 356 场周赛 | @@ -2902,21 +2902,21 @@ | 2889 | [数据重塑：透视](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README.md) | | 简单 | | | 2890 | [重塑数据：融合](/solution/2800-2899/2890.Reshape%20Data%20Melt/README.md) | | 简单 | | | 2891 | [方法链](/solution/2800-2899/2891.Method%20Chaining/README.md) | | 简单 | | -| 2892 | [将相邻元素相乘后得到最小化数组](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) | | 中等 | 🔒 | -| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | | 中等 | 🔒 | -| 2894 | [分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) | | 简单 | 第 366 场周赛 | -| 2895 | [最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) | | 中等 | 第 366 场周赛 | -| 2896 | [执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) | | 中等 | 第 366 场周赛 | -| 2897 | [对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) | | 困难 | 第 366 场周赛 | -| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) | | 中等 | 🔒 | -| 2899 | [上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) | | 简单 | 第 115 场双周赛 | -| 2900 | [最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) | | 中等 | 第 115 场双周赛 | -| 2901 | [最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) | | 中等 | 第 115 场双周赛 | -| 2902 | [和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) | | 困难 | 第 115 场双周赛 | -| 2903 | [找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) | | 简单 | 第 367 场周赛 | -| 2904 | [最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) | | 中等 | 第 367 场周赛 | -| 2905 | [找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) | | 中等 | 第 367 场周赛 | -| 2906 | [构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) | | 中等 | 第 367 场周赛 | +| 2892 | [将相邻元素相乘后得到最小化数组](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 🔒 | +| 2893 | [计算每个区间内的订单](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | `数据库` | 中等 | 🔒 | +| 2894 | [分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) | `数学` | 简单 | 第 366 场周赛 | +| 2895 | [最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 366 场周赛 | +| 2896 | [执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) | `字符串`,`动态规划` | 中等 | 第 366 场周赛 | +| 2897 | [对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) | `贪心`,`位运算`,`数组`,`哈希表` | 困难 | 第 366 场周赛 | +| 2898 | [最大线性股票得分](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) | `数组`,`哈希表` | 中等 | 🔒 | +| 2899 | [上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) | `数组`,`字符串`,`模拟` | 简单 | 第 115 场双周赛 | +| 2900 | [最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) | `贪心`,`数组`,`字符串`,`动态规划` | 中等 | 第 115 场双周赛 | +| 2901 | [最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 第 115 场双周赛 | +| 2902 | [和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) | `数组`,`哈希表`,`动态规划`,`滑动窗口` | 困难 | 第 115 场双周赛 | +| 2903 | [找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) | `数组` | 简单 | 第 367 场周赛 | +| 2904 | [最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) | `字符串`,`滑动窗口` | 中等 | 第 367 场周赛 | +| 2905 | [找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) | `数组` | 中等 | 第 367 场周赛 | +| 2906 | [构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 367 场周赛 | | 2907 | [Maximum Profitable Triplets With Increasing Prices I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README.md) | | 中等 | 🔒 | ## 版权 diff --git a/solution/README_EN.md b/solution/README_EN.md index 0fc62fbb814dd..7185b6772f123 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -285,7 +285,7 @@ Press Control + F(or Command + F on | 0274 | [H-Index](/solution/0200-0299/0274.H-Index/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Medium | | | 0275 | [H-Index II](/solution/0200-0299/0275.H-Index%20II/README_EN.md) | `Array`,`Binary Search` | Medium | | | 0276 | [Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README_EN.md) | `Dynamic Programming` | Medium | 🔒 | -| 0277 | [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) | `Greedy`,`Graph`,`Two Pointers`,`Interactive` | Medium | 🔒 | +| 0277 | [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) | `Graph`,`Two Pointers`,`Interactive` | Medium | 🔒 | | 0278 | [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md) | `Binary Search`,`Interactive` | Easy | | | 0279 | [Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README_EN.md) | `Breadth-First Search`,`Math`,`Dynamic Programming` | Medium | | | 0280 | [Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | @@ -356,12 +356,12 @@ Press Control + F(or Command + F on | 0345 | [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md) | `Two Pointers`,`String` | Easy | | | 0346 | [Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Array`,`Data Stream` | Easy | 🔒 | | 0347 | [Top K Frequent Elements](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Bucket Sort`,`Counting`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0348 | [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix` | Medium | 🔒 | +| 0348 | [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | 🔒 | | 0349 | [Intersection of Two Arrays](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | | 0350 | [Intersection of Two Arrays II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | | 0351 | [Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md) | `Dynamic Programming`,`Backtracking` | Medium | 🔒 | | 0352 | [Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README_EN.md) | `Design`,`Binary Search`,`Ordered Set` | Hard | | -| 0353 | [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) | `Design`,`Queue`,`Array`,`Matrix` | Medium | 🔒 | +| 0353 | [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Simulation` | Medium | 🔒 | | 0354 | [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | | | 0355 | [Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Heap (Priority Queue)` | Medium | | | 0356 | [Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | 🔒 | @@ -498,7 +498,7 @@ Press Control + F(or Command + F on | 0487 | [Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | 🔒 | | 0488 | [Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README_EN.md) | `Stack`,`Breadth-First Search`,`Memoization`,`String`,`Dynamic Programming` | Hard | | | 0489 | [Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md) | `Backtracking`,`Interactive` | Hard | 🔒 | -| 0490 | [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | 🔒 | +| 0490 | [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | | 0491 | [Non-decreasing Subsequences](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Backtracking` | Medium | | | 0492 | [Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README_EN.md) | `Math` | Easy | | | 0493 | [Reverse Pairs](/solution/0400-0499/0493.Reverse%20Pairs/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | @@ -507,13 +507,13 @@ Press Control + F(or Command + F on | 0496 | [Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Monotonic Stack` | Easy | | | 0497 | [Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README_EN.md) | `Reservoir Sampling`,`Array`,`Math`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Randomized` | Medium | | | 0498 | [Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | -| 0499 | [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0499 | [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`String`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | | 0500 | [Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | | 0501 | [Find Mode in Binary Search Tree](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | | 0502 | [IPO](/solution/0500-0599/0502.IPO/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | | | 0503 | [Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | | | 0504 | [Base 7](/solution/0500-0599/0504.Base%207/README_EN.md) | `Math` | Easy | | -| 0505 | [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | +| 0505 | [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | | 0506 | [Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | | | 0507 | [Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README_EN.md) | `Math` | Easy | | | 0508 | [Most Frequent Subtree Sum](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | | @@ -674,7 +674,7 @@ Press Control + F(or Command + F on | 0663 | [Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | | 0664 | [Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README_EN.md) | `String`,`Dynamic Programming` | Hard | | | 0665 | [Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README_EN.md) | `Array` | Medium | | -| 0666 | [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Binary Tree` | Medium | 🔒 | +| 0666 | [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | 🔒 | | 0667 | [Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README_EN.md) | `Array`,`Math` | Medium | | | 0668 | [Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README_EN.md) | `Math`,`Binary Search` | Hard | | | 0669 | [Trim a Binary Search Tree](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | @@ -802,7 +802,7 @@ Press Control + F(or Command + F on | 0791 | [Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | | | 0792 | [Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | | | 0793 | [Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README_EN.md) | `Math`,`Binary Search` | Hard | | -| 0794 | [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md) | `Array`,`String` | Medium | | +| 0794 | [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md) | `Array`,`Matrix` | Medium | | | 0795 | [Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README_EN.md) | `Array`,`Two Pointers` | Medium | | | 0796 | [Rotate String](/solution/0700-0799/0796.Rotate%20String/README_EN.md) | `String`,`String Matching` | Easy | | | 0797 | [All Paths From Source to Target](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Backtracking` | Medium | | @@ -2805,7 +2805,7 @@ Press Control + F(or Command + F on | 2794 | [Create Object from Two Arrays](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) | | Easy | 🔒 | | 2795 | [Parallel Execution of Promises for Individual Results Retrieval](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) | | Medium | 🔒 | | 2796 | [Repeat String](/solution/2700-2799/2796.Repeat%20String/README_EN.md) | | Easy | 🔒 | -| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Medium | 🔒 | +| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Easy | 🔒 | | 2798 | [Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 356 | | 2799 | [Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 356 | | 2800 | [Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) | `Greedy`,`String`,`Enumeration` | Medium | Weekly Contest 356 | @@ -2900,21 +2900,21 @@ Press Control + F(or Command + F on | 2889 | [Reshape Data Pivot](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README_EN.md) | | Easy | | | 2890 | [Reshape Data Melt](/solution/2800-2899/2890.Reshape%20Data%20Melt/README_EN.md) | | Easy | | | 2891 | [Method Chaining](/solution/2800-2899/2891.Method%20Chaining/README_EN.md) | | Easy | | -| 2892 | [Minimizing Array After Replacing Pairs With Their Product](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) | | Medium | 🔒 | -| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | | Medium | 🔒 | -| 2894 | [Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) | | Easy | Weekly Contest 366 | -| 2895 | [Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) | | Medium | Weekly Contest 366 | -| 2896 | [Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) | | Medium | Weekly Contest 366 | -| 2897 | [Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) | | Hard | Weekly Contest 366 | -| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) | | Medium | 🔒 | -| 2899 | [Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) | | Easy | Biweekly Contest 115 | -| 2900 | [Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) | | Medium | Biweekly Contest 115 | -| 2901 | [Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) | | Medium | Biweekly Contest 115 | -| 2902 | [Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) | | Hard | Biweekly Contest 115 | -| 2903 | [Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) | | Easy | Weekly Contest 367 | -| 2904 | [Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | | Medium | Weekly Contest 367 | -| 2905 | [Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) | | Medium | Weekly Contest 367 | -| 2906 | [Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) | | Medium | Weekly Contest 367 | +| 2892 | [Minimizing Array After Replacing Pairs With Their Product](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | 🔒 | +| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | `Database` | Medium | 🔒 | +| 2894 | [Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) | `Math` | Easy | Weekly Contest 366 | +| 2895 | [Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 366 | +| 2896 | [Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 366 | +| 2897 | [Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 366 | +| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 | +| 2899 | [Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) | `Array`,`String`,`Simulation` | Easy | Biweekly Contest 115 | +| 2900 | [Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 115 | +| 2901 | [Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 115 | +| 2902 | [Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sliding Window` | Hard | Biweekly Contest 115 | +| 2903 | [Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) | `Array` | Easy | Weekly Contest 367 | +| 2904 | [Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 367 | +| 2905 | [Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) | `Array` | Medium | Weekly Contest 367 | +| 2906 | [Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 367 | | 2907 | [Maximum Profitable Triplets With Increasing Prices I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README_EN.md) | | Medium | 🔒 | ## Copyright diff --git a/solution/database-summary.md b/solution/database-summary.md index f033eaa9fa179..b3f657b752972 100644 --- a/solution/database-summary.md +++ b/solution/database-summary.md @@ -235,4 +235,4 @@ - [2837.总旅行距离](/database-solution/2800-2899/2837.Total%20Traveled%20Distance/README.md) - [2853.最高薪水差异](/database-solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) - [2854.滚动平均步数](/database-solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) - - [2893.Calculate Orders Within Each Interval](/database-solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) + - [2893.计算每个区间内的订单](/database-solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) diff --git a/solution/summary.md b/solution/summary.md index f8e1029fb7aa9..976db981c79e2 100644 --- a/solution/summary.md +++ b/solution/summary.md @@ -287,7 +287,7 @@ - [0281.锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md) - [0282.给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md) - [0283.移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md) - - [0284.顶端迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) + - [0284.窥视迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) - [0285.二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md) - [0286.墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md) - [0287.寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md) @@ -2948,12 +2948,12 @@ - [2890.重塑数据：融合](/solution/2800-2899/2890.Reshape%20Data%20Melt/README.md) - [2891.方法链](/solution/2800-2899/2891.Method%20Chaining/README.md) - [2892.将相邻元素相乘后得到最小化数组](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) - - [2893.Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) + - [2893.计算每个区间内的订单](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) - [2894.分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) - [2895.最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) - [2896.执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) - [2897.对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) - - [2898.Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) + - [2898.最大线性股票得分](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) - [2899.上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) - 2900-2999 From 151d73e205dcd6ff2ac3b6d9b0aeb7ebb309e78b Mon Sep 17 00:00:00 2001 From: Doocs Bot