From 75d47fc7cf5fcab4ebdcd215ea944e2d9337e1d0 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Wed, 4 Sep 2024 09:03:15 +0800 Subject: [PATCH] feat: update lc problems (#3488) --- .../README.md" | 6 +-- .../README.md" | 8 +-- .../README.md" | 6 +-- .../README.md" | 10 ++-- .../README.md" | 6 +-- .../2800-2899/2860.Happy Students/README.md | 1 + .../2860.Happy Students/README_EN.md | 1 + .../2800-2899/2860.Happy Students/Solution.py | 1 + .../README.md | 4 +- .../3268.Find Overlapping Shifts II/README.md | 4 +- .../README.md | 3 ++ .../README_EN.md | 3 ++ .../README.md | 2 + .../README_EN.md | 2 + .../3271.Hash Divided String/README.md | 3 ++ .../3271.Hash Divided String/README_EN.md | 3 ++ .../README.md | 5 ++ .../README_EN.md | 5 ++ .../README.md | 4 ++ .../README_EN.md | 4 ++ .../README.md | 3 ++ .../README_EN.md | 3 ++ .../README.md | 3 ++ .../README_EN.md | 3 ++ .../README.md | 6 +++ .../README_EN.md | 6 +++ .../README.md | 3 ++ .../README_EN.md | 3 ++ .../README.md | 51 ++++++++++--------- solution/DATABASE_README.md | 2 +- solution/DATABASE_README_EN.md | 2 +- solution/README.md | 20 ++++---- solution/README_EN.md | 20 ++++---- 33 files changed, 137 insertions(+), 69 deletions(-) diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262/README.md" index 7fffa67082866..30e36f8da74c8 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 086. \345\210\206\345\211\262\345\233\236\346\226\207\345\255\220\345\255\227\347\254\246\344\270\262/README.md" @@ -299,15 +299,15 @@ class Solution { n = s.count self.s = s f = Array(repeating: Array(repeating: true, count: n), count: n) - + let chars = Array(s) - + for i in stride(from: n - 1, through: 0, by: -1) { for j in i + 1 ..< n { f[i][j] = chars[i] == chars[j] && f[i + 1][j - 1] } } - + dfs(0) return ans } diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 092. \347\277\273\350\275\254\345\255\227\347\254\246/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 092. \347\277\273\350\275\254\345\255\227\347\254\246/README.md" index eff3dc462254c..4b70101d608db 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 092. \347\277\273\350\275\254\345\255\227\347\254\246/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 092. \347\277\273\350\275\254\345\255\227\347\254\246/README.md" @@ -188,22 +188,22 @@ class Solution { let n = s.count var left0 = 0, right0 = 0 let chars = Array(s) - + for char in chars { if char == "0" { right0 += 1 } } - + var ans = min(right0, n - right0) - + for i in 1...n { let x = chars[i - 1] == "0" ? 0 : 1 right0 -= x ^ 1 left0 += x ^ 1 ans = min(ans, i - left0 + right0) } - + return ans } } diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md" index 14fb67e2ab339..feb0c3507b3d6 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md" @@ -198,10 +198,10 @@ class Solution { for i in 0.. 2 ? ans : 0 } } diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 094. \346\234\200\345\260\221\345\233\236\346\226\207\345\210\206\345\211\262/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 094. \346\234\200\345\260\221\345\233\236\346\226\207\345\210\206\345\211\262/README.md" index 7d0858ade6519..1e5468831a809 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 094. \346\234\200\345\260\221\345\233\236\346\226\207\345\210\206\345\211\262/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 094. \346\234\200\345\260\221\345\233\236\346\226\207\345\210\206\345\211\262/README.md" @@ -256,20 +256,20 @@ class Solution { func minCut(_ s: String) -> Int { let n = s.count let sArray = Array(s) - + var g = Array(repeating: Array(repeating: true, count: n), count: n) - + for i in stride(from: n - 1, through: 0, by: -1) { for j in i + 1.. int: continue if i < n and nums[i] <= i: continue + ans += 1 return ans diff --git a/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md b/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md index 7809df863f835..e2028860493ea 100644 --- a/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md +++ b/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md @@ -53,8 +53,8 @@ tags: 输入：source = "aaaa", target = "bbbb", original = ["a","c"], changed = ["c","b"], cost = [1,2] 输出：12 解释：要将字符 'a' 更改为 'b'： -- 将字符 'a' 更改为 'c'，成本为 1 -- 将字符 'c' 更改为 'b'，成本为 2 +- 将字符 'a' 更改为 'c'，成本为 1 +- 将字符 'c' 更改为 'b'，成本为 2 产生的总成本是 1 + 2 = 3。 将所有 'a' 更改为 'b'，产生的总成本是 3 * 4 = 12 。 diff --git a/solution/3200-3299/3268.Find Overlapping Shifts II/README.md b/solution/3200-3299/3268.Find Overlapping Shifts II/README.md index 86cc958268c18..0bd4b69a55f66 100644 --- a/solution/3200-3299/3268.Find Overlapping Shifts II/README.md +++ b/solution/3200-3299/3268.Find Overlapping Shifts II/README.md @@ -30,12 +30,12 @@ tags: 这张表包含员工的排班工作，包括特定日期的开始和结束时间。 -

编写一个解决方案来为每个员工分析重叠排班。如果一个排班的 end_time 比另一个排班的 start_time 更晚 则认为两个排班重叠。

+

编写一个解决方案来为每个员工分析重叠排班。如果两个排班在 同一天 且一个排班的 end_time 比另一个排班的 start_time 更晚 则认为两个排班重叠。

对于 每个员工，计算如下内容：

    -
  1. 任何 给定时间重叠 的 最大 班次数。
    2. +
  2. 任何 给定时间 的 最多重叠 班次数。
  3. 所有重叠班次的 总持续时间，以分钟为单位。
diff --git a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md index 9a00fca5cee30..cd4ffce265694 100644 --- a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md +++ b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md @@ -2,6 +2,9 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README.md +tags: + - 数组 + - 动态规划 --- diff --git a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md index 258d06c133944..db23727a9264f 100644 --- a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md +++ b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md @@ -2,6 +2,9 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README_EN.md +tags: + - Array + - Dynamic Programming --- diff --git a/solution/3200-3299/3270.Find the Key of the Numbers/README.md b/solution/3200-3299/3270.Find the Key of the Numbers/README.md index f74a321a8cd38..7c8ca3da5655d 100644 --- a/solution/3200-3299/3270.Find the Key of the Numbers/README.md +++ b/solution/3200-3299/3270.Find the Key of the Numbers/README.md @@ -2,6 +2,8 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README.md +tags: + - 数学 --- diff --git a/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md b/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md index 700019fc12df6..351be580f80c6 100644 --- a/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md +++ b/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md @@ -2,6 +2,8 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README_EN.md +tags: + - Math --- diff --git a/solution/3200-3299/3271.Hash Divided String/README.md b/solution/3200-3299/3271.Hash Divided String/README.md index 5bfb9be9469e7..f3ac1105745fc 100644 --- a/solution/3200-3299/3271.Hash Divided String/README.md +++ b/solution/3200-3299/3271.Hash Divided String/README.md @@ -2,6 +2,9 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3271.Hash%20Divided%20String/README.md +tags: + - 字符串 + - 模拟 --- diff --git a/solution/3200-3299/3271.Hash Divided String/README_EN.md b/solution/3200-3299/3271.Hash Divided String/README_EN.md index a53959bc39bed..0cf7a432b25c2 100644 --- a/solution/3200-3299/3271.Hash Divided String/README_EN.md +++ b/solution/3200-3299/3271.Hash Divided String/README_EN.md @@ -2,6 +2,9 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3271.Hash%20Divided%20String/README_EN.md +tags: + - String + - Simulation --- diff --git a/solution/3200-3299/3272.Find the Count of Good Integers/README.md b/solution/3200-3299/3272.Find the Count of Good Integers/README.md index c7714d06f5fe4..58d6e965b0ef2 100644 --- a/solution/3200-3299/3272.Find the Count of Good Integers/README.md +++ b/solution/3200-3299/3272.Find the Count of Good Integers/README.md @@ -2,6 +2,11 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README.md +tags: + - 哈希表 + - 数学 + - 组合数学 + - 枚举 --- diff --git a/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md b/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md index 0eeee9bda0643..70035b20e7786 100644 --- a/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md +++ b/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md @@ -2,6 +2,11 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README_EN.md +tags: + - Hash Table + - Math + - Combinatorics + - Enumeration --- diff --git a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md index a736ea0df39f6..056bf0151e2f5 100644 --- a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md +++ b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md @@ -2,6 +2,10 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README.md +tags: + - 贪心 + - 数组 + - 排序 --- diff --git a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md index 70501cd45fec6..777c541447ec7 100644 --- a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md +++ b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md @@ -2,6 +2,10 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README_EN.md +tags: + - Greedy + - Array + - Sorting --- diff --git a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md index e17fedb01b2a0..073c5282b5837 100644 --- a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md +++ b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md @@ -2,6 +2,9 @@ comments: true difficulty: 简单 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README.md +tags: + - 数学 + - 字符串 --- diff --git a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md index 1ad5139e272eb..b99a27dfa0857 100644 --- a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md +++ b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md @@ -2,6 +2,9 @@ comments: true difficulty: Easy edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README_EN.md +tags: + - Math + - String --- diff --git a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md index 9fbb692d4ad97..fbd980ace751a 100644 --- a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md +++ b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md @@ -2,6 +2,9 @@ comments: true difficulty: 中等 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README.md +tags: + - 数组 + - 堆（优先队列） --- diff --git a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md index 21305b3d668f2..1cb9334599155 100644 --- a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md +++ b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md @@ -2,6 +2,9 @@ comments: true difficulty: Medium edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README_EN.md +tags: + - Array + - Heap (Priority Queue) --- diff --git a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md index 3e3b26778c497..e865f5d71a7e0 100644 --- a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md +++ b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md @@ -2,6 +2,12 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README.md +tags: + - 位运算 + - 数组 + - 动态规划 + - 状态压缩 + - 矩阵 --- diff --git a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md index 27ce84e93e738..eb73ec9716089 100644 --- a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md +++ b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md @@ -2,6 +2,12 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md +tags: + - Bit Manipulation + - Array + - Dynamic Programming + - Bitmask + - Matrix --- diff --git a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md index 73ac2999517bf..5339a28261699 100644 --- a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md +++ b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md @@ -2,6 +2,9 @@ comments: true difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README.md +tags: + - 数组 + - 动态规划 --- diff --git a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md index c9845aee92c6a..e7d3954a6c8ef 100644 --- a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md +++ b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md @@ -2,6 +2,9 @@ comments: true difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md +tags: + - Array + - Dynamic Programming --- diff --git a/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md b/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md index c8fcb9c764b8e..ba80832e5d3d5 100644 --- a/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md +++ b/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md @@ -8,7 +8,7 @@ tags: -# [3278. Find Candidates for Data Scientist Position II 🔒](https://leetcode.cn/problems/find-candidates-for-data-scientist-position-ii) +# [3278. 寻找数据科学家职位的候选人 II 🔒](https://leetcode.cn/problems/find-candidates-for-data-scientist-position-ii) [English Version](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) @@ -16,7 +16,7 @@ tags: -

Table: Candidates

+

表：Candidates

 +--------------+---------+ 
@@ -26,11 +26,11 @@ tags:
 | skill        | varchar |
 | proficiency  | int     |
 +--------------+---------+
-(candidate_id, skill) is the unique key for this table.
-Each row includes candidate_id, skill, and proficiency level (1-5).
+是这张表的主键（有不同值的列）。 
+每一行包括 candidate_id 和技能，以及熟练程度（1-5）。
-

Table: Projects

+

表：Projects

 +--------------+---------+ 
@@ -40,36 +40,37 @@ Each row includes candidate_id, skill, and proficiency level (1-5).
 | skill        | varchar |
 | importance   | int     |
 +--------------+---------+
-(project_id, skill) is the primary key for this table.
-Each row includes project_id, required skill, and its importance (1-5) for the project.
+(project_id, skill) 是这张表的主键。
+每一行包括 project_id，所需技能，以及项目的重要性（1-5）。
-

Leetcode is staffing for multiple data science projects. Write a solution to find the best candidate for each project based on the following criteria:

+

Leetcode 正在为多个数据科学项目招聘人员。编写一个解决方案来根据以下条件为 每一个项目 找到 最佳候选人：

    -
  1. Candidates must have all the skills required for a project.
    2. -
  2. Calculate a score for each candidate-project pair as follows: +
  3. 候选人必须拥有项目所需的 所有 技能。
    4. +
  4. 为每个候选人-项目对计算如下的 分数：
      -
    • Start with 100 points
      • -
    • Add 10 points for each skill where proficiency > importance
      • -
    • Subtract 5 points for each skill where proficiency < importance
      • +
    • 从 100 分 开始。
      • +
    • 对于每一个技能，当 熟练程度 > 重要性 加 10 分。
      • +
    • 对于每一个技能，当 熟练程度 < 重要性 减 5 分。
-

Include only the top candidate (highest score) for each project. If there’s a tie, choose the candidate with the lower candidate_id. If there is no suitable candidate for a project, do not return that project.

+

仅包括每个项目的最佳候选人（最高分）。如果 相同，选择有 更小 candidate_id 的候选人。如果一个项目 没有适合的候选人，不要返回 那个项目。

-

Return a result table ordered by project_id in ascending order.

+

返回结果表以 project_id 升序排序。

-

The result format is in the following example.

+

输出格式如下所示。

 

-

Example:

+ +

示例：

-

Input:

+

输入：

-

Candidates table:

+

Candidates 表：

 +--------------+-----------+-------------+
@@ -90,7 +91,7 @@ Each row includes project_id, required skill, and its importance (1-5) for the p
 +--------------+-----------+-------------+
-

Projects table:

+

Projects 表：

 +-------------+-----------+------------+
@@ -105,7 +106,7 @@ Each row includes project_id, required skill, and its importance (1-5) for the p
 +-------------+-----------+------------+
-

Output:

+

输出：

 +-------------+--------------+-------+
@@ -116,14 +117,14 @@ Each row includes project_id, required skill, and its importance (1-5) for the p
 +-------------+--------------+-------+
-

Explanation:

+

解释：

    -
  • For Project 501, Candidate 101 has the highest score of 105. All other candidates have the same score but Candidate 101 has the lowest candidate_id among them.
    • -
  • For Project 502, Candidate 102 has the highest score of 130.
    • +
  • 对于项目 501, 候选人 101 有最高的 105 分。所有其他的候选人有相同的分数，但候选人 101 有比他们更小的 candidate_id。
    • +
  • 对于项目 502，候选人 102 有最高的 130 分。
-

The output table is ordered by project_id in ascending order.

+

输出表以 project_id 升序排序。

diff --git a/solution/DATABASE_README.md b/solution/DATABASE_README.md index ad5c9bcac912f..cedaecced69a6 100644 --- a/solution/DATABASE_README.md +++ b/solution/DATABASE_README.md @@ -294,7 +294,7 @@ | 3252 | [英超积分榜排名 II](/solution/3200-3299/3252.Premier%20League%20Table%20Ranking%20II/README.md) | `数据库` | 中等 | 🔒 | | 3262 | [查找重叠的班次](/solution/3200-3299/3262.Find%20Overlapping%20Shifts/README.md) | `数据库` | 中等 | 🔒 | | 3268 | [查找重叠的班次 II](/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README.md) | `数据库` | 困难 | 🔒 | -| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README.md) | | 中等 | 🔒 | +| 3278 | [寻找数据科学家职位的候选人 II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README.md) | `数据库` | 中等 | 🔒 | ## 版权 diff --git a/solution/DATABASE_README_EN.md b/solution/DATABASE_README_EN.md index a8d4451223a4f..afe41d8224251 100644 --- a/solution/DATABASE_README_EN.md +++ b/solution/DATABASE_README_EN.md @@ -292,7 +292,7 @@ Press Control + F(or Command + F on | 3252 | [Premier League Table Ranking II](/solution/3200-3299/3252.Premier%20League%20Table%20Ranking%20II/README_EN.md) | `Database` | Medium | 🔒 | | 3262 | [Find Overlapping Shifts](/solution/3200-3299/3262.Find%20Overlapping%20Shifts/README_EN.md) | `Database` | Medium | 🔒 | | 3268 | [Find Overlapping Shifts II](/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) | | Medium | 🔒 | +| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) | `Database` | Medium | 🔒 | ## Copyright diff --git a/solution/README.md b/solution/README.md index 902f25ae0b6ef..b3380fcf37212 100644 --- a/solution/README.md +++ b/solution/README.md @@ -3279,16 +3279,16 @@ | 3266 | [K 次乘运算后的最终数组 II](/solution/3200-3299/3266.Final%20Array%20State%20After%20K%20Multiplication%20Operations%20II/README.md) | `数组`,`模拟`,`堆（优先队列）` | 困难 | 第 412 场周赛 | | 3267 | [统计近似相等数对 II](/solution/3200-3299/3267.Count%20Almost%20Equal%20Pairs%20II/README.md) | `数组`,`哈希表`,`计数`,`枚举`,`排序` | 困难 | 第 412 场周赛 | | 3268 | [查找重叠的班次 II](/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README.md) | `数据库` | 困难 | 🔒 | -| 3269 | [Constructing Two Increasing Arrays](/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README.md) | | 困难 | 🔒 | -| 3270 | [求出数字答案](/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README.md) | | 简单 | 第 138 场双周赛 | -| 3271 | [哈希分割字符串](/solution/3200-3299/3271.Hash%20Divided%20String/README.md) | | 中等 | 第 138 场双周赛 | -| 3272 | [统计好整数的数目](/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README.md) | | 困难 | 第 138 场双周赛 | -| 3273 | [对 Bob 造成的最少伤害](/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README.md) | | 困难 | 第 138 场双周赛 | -| 3274 | [检查棋盘方格颜色是否相同](/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README.md) | | 简单 | 第 413 场周赛 | -| 3275 | [第 K 近障碍物查询](/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README.md) | | 中等 | 第 413 场周赛 | -| 3276 | [选择矩阵中单元格的最大得分](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README.md) | | 困难 | 第 413 场周赛 | -| 3277 | [查询子数组最大异或值](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README.md) | | 困难 | 第 413 场周赛 | -| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README.md) | | 中等 | 🔒 | +| 3269 | [Constructing Two Increasing Arrays](/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 3270 | [求出数字答案](/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README.md) | `数学` | 简单 | 第 138 场双周赛 | +| 3271 | [哈希分割字符串](/solution/3200-3299/3271.Hash%20Divided%20String/README.md) | `字符串`,`模拟` | 中等 | 第 138 场双周赛 | +| 3272 | [统计好整数的数目](/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README.md) | `哈希表`,`数学`,`组合数学`,`枚举` | 困难 | 第 138 场双周赛 | +| 3273 | [对 Bob 造成的最少伤害](/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 138 场双周赛 | +| 3274 | [检查棋盘方格颜色是否相同](/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README.md) | `数学`,`字符串` | 简单 | 第 413 场周赛 | +| 3275 | [第 K 近障碍物查询](/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README.md) | `数组`,`堆（优先队列）` | 中等 | 第 413 场周赛 | +| 3276 | [选择矩阵中单元格的最大得分](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵` | 困难 | 第 413 场周赛 | +| 3277 | [查询子数组最大异或值](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README.md) | `数组`,`动态规划` | 困难 | 第 413 场周赛 | +| 3278 | [寻找数据科学家职位的候选人 II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README.md) | `数据库` | 中等 | 🔒 | ## 版权 diff --git a/solution/README_EN.md b/solution/README_EN.md index 6aa01bfcb62e3..596c423224824 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -3277,16 +3277,16 @@ Press Control + F(or Command + F on | 3266 | [Final Array State After K Multiplication Operations II](/solution/3200-3299/3266.Final%20Array%20State%20After%20K%20Multiplication%20Operations%20II/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 412 | | 3267 | [Count Almost Equal Pairs II](/solution/3200-3299/3267.Count%20Almost%20Equal%20Pairs%20II/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Sorting` | Hard | Weekly Contest 412 | | 3268 | [Find Overlapping Shifts II](/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 3269 | [Constructing Two Increasing Arrays](/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README_EN.md) | | Hard | 🔒 | -| 3270 | [Find the Key of the Numbers](/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README_EN.md) | | Easy | Biweekly Contest 138 | -| 3271 | [Hash Divided String](/solution/3200-3299/3271.Hash%20Divided%20String/README_EN.md) | | Medium | Biweekly Contest 138 | -| 3272 | [Find the Count of Good Integers](/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README_EN.md) | | Hard | Biweekly Contest 138 | -| 3273 | [Minimum Amount of Damage Dealt to Bob](/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README_EN.md) | | Hard | Biweekly Contest 138 | -| 3274 | [Check if Two Chessboard Squares Have the Same Color](/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README_EN.md) | | Easy | Weekly Contest 413 | -| 3275 | [K-th Nearest Obstacle Queries](/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README_EN.md) | | Medium | Weekly Contest 413 | -| 3276 | [Select Cells in Grid With Maximum Score](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md) | | Hard | Weekly Contest 413 | -| 3277 | [Maximum XOR Score Subarray Queries](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md) | | Hard | Weekly Contest 413 | -| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) | | Medium | 🔒 | +| 3269 | [Constructing Two Increasing Arrays](/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 3270 | [Find the Key of the Numbers](/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README_EN.md) | `Math` | Easy | Biweekly Contest 138 | +| 3271 | [Hash Divided String](/solution/3200-3299/3271.Hash%20Divided%20String/README_EN.md) | `String`,`Simulation` | Medium | Biweekly Contest 138 | +| 3272 | [Find the Count of Good Integers](/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README_EN.md) | `Hash Table`,`Math`,`Combinatorics`,`Enumeration` | Hard | Biweekly Contest 138 | +| 3273 | [Minimum Amount of Damage Dealt to Bob](/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Biweekly Contest 138 | +| 3274 | [Check if Two Chessboard Squares Have the Same Color](/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 413 | +| 3275 | [K-th Nearest Obstacle Queries](/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 413 | +| 3276 | [Select Cells in Grid With Maximum Score](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 413 | +| 3277 | [Maximum XOR Score Subarray Queries](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 413 | +| 3278 | [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md) | `Database` | Medium | 🔒 | ## Copyright