From 1f3a08025c83fcee301e219a086cd35437279433 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Thu, 30 Jan 2025 08:44:08 +0800 Subject: [PATCH] feat: update lc problems --- .../README.md | 2 +- solution/0500-0599/0554.Brick Wall/README.md | 14 ++++---- .../0906.Super Palindromes/README.md | 1 + .../0906.Super Palindromes/README_EN.md | 1 + .../1023.Camelcase Matching/README.md | 2 +- .../1023.Camelcase Matching/README_EN.md | 2 +- .../1183.Maximum Number of Ones/README.md | 2 ++ .../1183.Maximum Number of Ones/README_EN.md | 2 ++ .../README.md | 2 +- .../README.md | 1 + .../README_EN.md | 1 + .../README.md | 4 +-- .../README.md | 1 + .../README_EN.md | 1 + .../README_EN.md | 4 +-- .../README.md | 1 + .../README_EN.md | 1 + .../README.md | 1 + .../README_EN.md | 1 + .../README.md | 1 + .../README_EN.md | 1 + .../README.md | 1 + .../README_EN.md | 1 + .../README.md | 6 ++-- .../README_EN.md | 6 ++-- .../README.md | 2 +- .../README_EN.md | 2 +- .../3421.Find Students Who Improved/README.md | 27 +++++++------- .../README.md | 6 ++++ .../README_EN.md | 6 ++++ .../README.md | 2 ++ .../README_EN.md | 2 ++ .../README.md | 4 +++ .../README_EN.md | 8 +++-- .../3425.Longest Special Path/README.md | 6 ++++ .../3425.Longest Special Path/README_EN.md | 8 ++++- .../README.md | 3 ++ .../README_EN.md | 4 ++- .../README.md | 3 ++ .../README_EN.md | 7 ++-- .../README.md | 6 ++++ .../README_EN.md | 12 ++++--- .../3400-3499/3429.Paint House IV/README.md | 3 ++ .../3429.Paint House IV/README_EN.md | 4 ++- .../README.md | 5 +++ .../README_EN.md | 9 +++-- solution/README.md | 36 +++++++++---------- solution/README_EN.md | 36 +++++++++---------- solution/contest.json | 2 +- 49 files changed, 176 insertions(+), 87 deletions(-) diff --git a/solution/0200-0299/0238.Product of Array Except Self/README.md b/solution/0200-0299/0238.Product of Array Except Self/README.md index 67da7fdbca128..79e44b45c211e 100644 --- a/solution/0200-0299/0238.Product of Array Except Self/README.md +++ b/solution/0200-0299/0238.Product of Array Except Self/README.md @@ -46,7 +46,7 @@ tags:

 

diff --git a/solution/0500-0599/0554.Brick Wall/README.md b/solution/0500-0599/0554.Brick Wall/README.md index 76f8531a69bd9..d30fa899cdad7 100644 --- a/solution/0500-0599/0554.Brick Wall/README.md +++ b/solution/0500-0599/0554.Brick Wall/README.md @@ -23,10 +23,10 @@ tags:

给你一个二维数组 wall ，该数组包含这堵墙的相关信息。其中，wall[i] 是一个代表从左至右每块砖的宽度的数组。你需要找出怎样画才能使这条线 穿过的砖块数量最少 ，并且返回 穿过的砖块数量 。

-

 

+

 

示例 1：

- + 
 输入：wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
 输出：2
@@ -39,15 +39,17 @@ tags:
 输出：3
+  +

提示：

diff --git a/solution/0900-0999/0906.Super Palindromes/README.md b/solution/0900-0999/0906.Super Palindromes/README.md index 4f24acb28b787..1e5dd11b307d6 100644 --- a/solution/0900-0999/0906.Super Palindromes/README.md +++ b/solution/0900-0999/0906.Super Palindromes/README.md @@ -4,6 +4,7 @@ difficulty: 困难 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README.md tags: - 数学 + - 字符串 - 枚举 --- diff --git a/solution/0900-0999/0906.Super Palindromes/README_EN.md b/solution/0900-0999/0906.Super Palindromes/README_EN.md index 06278797b1d04..6283c49fdda42 100644 --- a/solution/0900-0999/0906.Super Palindromes/README_EN.md +++ b/solution/0900-0999/0906.Super Palindromes/README_EN.md @@ -4,6 +4,7 @@ difficulty: Hard edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README_EN.md tags: - Math + - String - Enumeration --- diff --git a/solution/1000-1099/1023.Camelcase Matching/README.md b/solution/1000-1099/1023.Camelcase Matching/README.md index 638c7c2fc3929..d6f7393d6528c 100644 --- a/solution/1000-1099/1023.Camelcase Matching/README.md +++ b/solution/1000-1099/1023.Camelcase Matching/README.md @@ -24,7 +24,7 @@ tags:

给你一个字符串数组 queries，和一个表示模式的字符串 pattern，请你返回一个布尔数组 answer 。只有在待查项 queries[i] 与模式串 pattern 匹配时， answer[i] 才为 true，否则为 false。

-

如果可以将小写字母插入模式串 pattern 得到待查询项 queries[i]，那么待查询项与给定模式串匹配。可以在任何位置插入每个字符，也可以不插入字符。

+

如果可以将 小写字母 插入模式串 pattern 得到待查询项 queries[i]，那么待查询项与给定模式串匹配。您可以在模式串中的任何位置插入字符，也可以选择不插入任何字符。

 

diff --git a/solution/1000-1099/1023.Camelcase Matching/README_EN.md b/solution/1000-1099/1023.Camelcase Matching/README_EN.md index b6da81fc03815..5b63466f5648e 100644 --- a/solution/1000-1099/1023.Camelcase Matching/README_EN.md +++ b/solution/1000-1099/1023.Camelcase Matching/README_EN.md @@ -24,7 +24,7 @@ tags:

Given an array of strings queries and a string pattern, return a boolean array answer where answer[i] is true if queries[i] matches pattern, and false otherwise.

-

A query word queries[i] matches pattern if you can insert lowercase English letters pattern so that it equals the query. You may insert each character at any position and you may not insert any characters.

+

A query word queries[i] matches pattern if you can insert lowercase English letters into the pattern so that it equals the query. You may insert a character at any position in pattern or you may choose not to insert any characters at all.

 

Example 1:

diff --git a/solution/1100-1199/1183.Maximum Number of Ones/README.md b/solution/1100-1199/1183.Maximum Number of Ones/README.md index c0a0be15103ce..979b318343248 100644 --- a/solution/1100-1199/1183.Maximum Number of Ones/README.md +++ b/solution/1100-1199/1183.Maximum Number of Ones/README.md @@ -6,6 +6,8 @@ rating: 2366 source: 第 8 场双周赛 Q4 tags: - 贪心 + - 数学 + - 排序 - 堆（优先队列） --- diff --git a/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md b/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md index 981c98aca770a..348856d5e478c 100644 --- a/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md +++ b/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md @@ -6,6 +6,8 @@ rating: 2366 source: Biweekly Contest 8 Q4 tags: - Greedy + - Math + - Sorting - Heap (Priority Queue) --- diff --git a/solution/1400-1499/1400.Construct K Palindrome Strings/README.md b/solution/1400-1499/1400.Construct K Palindrome Strings/README.md index fe8d098302ddd..0f5bdb4c901c7 100644 --- a/solution/1400-1499/1400.Construct K Palindrome Strings/README.md +++ b/solution/1400-1499/1400.Construct K Palindrome Strings/README.md @@ -21,7 +21,7 @@ tags: -

给你一个字符串 s 和一个整数 k 。请你用 s 字符串中 所有字符 构造 k 个非空 回文串 。

+

给你一个字符串 s 和一个整数 k 。请你用 s 字符串中 所有字符 构造 k 个非空 回文串 。

如果你可以用 s 中所有字符构造 k 个回文字符串，那么请你返回 True ，否则返回 False 。

diff --git a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md index 6d9f1b0bc2f0d..c05295e151565 100644 --- a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md +++ b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md @@ -9,6 +9,7 @@ tags: - 数组 - 动态规划 - 矩阵 + - 前缀和 --- diff --git a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README_EN.md b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README_EN.md index 236675a85adf5..92fee899b7cef 100644 --- a/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README_EN.md +++ b/solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README_EN.md @@ -9,6 +9,7 @@ tags: - Array - Dynamic Programming - Matrix + - Prefix Sum --- diff --git a/solution/1400-1499/1467.Probability of a Two Boxes Having The Same Number of Distinct Balls/README.md b/solution/1400-1499/1467.Probability of a Two Boxes Having The Same Number of Distinct Balls/README.md index 687781d87a4c3..47424ab70f5f3 100644 --- a/solution/1400-1499/1467.Probability of a Two Boxes Having The Same Number of Distinct Balls/README.md +++ b/solution/1400-1499/1467.Probability of a Two Boxes Having The Same Number of Distinct Balls/README.md @@ -23,13 +23,13 @@ tags: -

桌面上有 2n 个颜色不完全相同的球，球上的颜色共有 k 种。给你一个大小为 k 的整数数组 balls ，其中 balls[i] 是颜色为 i 的球的数量。

+

桌面上有 2n 个颜色不完全相同的球，球的颜色共有 k 种。给你一个大小为 k 的整数数组 balls ，其中 balls[i] 是颜色为 i 的球的数量。

所有的球都已经 随机打乱顺序 ，前 n 个球放入第一个盒子，后 n 个球放入另一个盒子（请认真阅读示例 2 的解释部分）。

注意：这两个盒子是不同的。例如，两个球颜色分别为 a 和 b，盒子分别为 [] 和 ()，那么 [a] (b) 和 [b] (a) 这两种分配方式是不同的（请认真阅读示例的解释部分）。

-

请返回「两个盒子中球的颜色数相同」的情况的概率。答案与真实值误差在 10^-5 以内，则被视为正确答案

+

请返回「两个盒子中球的颜色数相同」的情况的概率。答案与真实值误差在 10-5 以内，则被视为正确答案

 

diff --git a/solution/2000-2099/2021.Brightest Position on Street/README.md b/solution/2000-2099/2021.Brightest Position on Street/README.md index a75ce02edbdb5..53d29e227d7b6 100644 --- a/solution/2000-2099/2021.Brightest Position on Street/README.md +++ b/solution/2000-2099/2021.Brightest Position on Street/README.md @@ -6,6 +6,7 @@ tags: - 数组 - 有序集合 - 前缀和 + - 排序 --- diff --git a/solution/2000-2099/2021.Brightest Position on Street/README_EN.md b/solution/2000-2099/2021.Brightest Position on Street/README_EN.md index b1d2f9bfb9d07..d6ad91c252596 100644 --- a/solution/2000-2099/2021.Brightest Position on Street/README_EN.md +++ b/solution/2000-2099/2021.Brightest Position on Street/README_EN.md @@ -6,6 +6,7 @@ tags: - Array - Ordered Set - Prefix Sum + - Sorting --- 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 8a22a21228c99..f785cb92f0345 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 @@ -35,7 +35,7 @@ tags: 
 Input: x = 2, y = 5, z = 1
 Output: 12
-Explanation: We can concactenate the strings "BB", "AA", "BB", "AA", "BB", and "AB" in that order. Then, our new string is "BBAABBAABBAB". 
+Explanation: We can concatenate the strings "BB", "AA", "BB", "AA", "BB", and "AB" in that order. Then, our new string is "BBAABBAABBAB". 
 That string has length 12, and we can show that it is impossible to construct a string of longer length.
@@ -44,7 +44,7 @@ That string has length 12, and we can show that it is impossible to construct a 
 Input: x = 3, y = 2, z = 2
 Output: 14
-Explanation: We can concactenate the strings "AB", "AB", "AA", "BB", "AA", "BB", and "AA" in that order. Then, our new string is "ABABAABBAABBAA". 
+Explanation: We can concatenate the strings "AB", "AB", "AA", "BB", "AA", "BB", and "AA" in that order. Then, our new string is "ABABAABBAABBAA". 
 That string has length 14, and we can show that it is impossible to construct a string of longer length.
diff --git a/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README.md b/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README.md index 7b4bba65a2fea..530456ee5699e 100644 --- a/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README.md +++ b/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README.md @@ -7,6 +7,7 @@ source: 第 351 场周赛 Q2 tags: - 位运算 - 脑筋急转弯 + - 枚举 --- diff --git a/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README_EN.md b/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README_EN.md index 45530dc18abf5..e7bc954df6367 100644 --- a/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README_EN.md +++ b/solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README_EN.md @@ -7,6 +7,7 @@ source: Weekly Contest 351 Q2 tags: - Bit Manipulation - Brainteaser + - Enumeration --- diff --git a/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md b/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md index e80bfa619a738..298f6b0e10d86 100644 --- a/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md +++ b/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md @@ -10,6 +10,7 @@ tags: - 数组 - 二分查找 - 矩阵 + - 堆（优先队列） --- diff --git a/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md b/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md index a24aed2dea276..8149d0a17a8c3 100644 --- a/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md +++ b/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md @@ -10,6 +10,7 @@ tags: - Array - Binary Search - Matrix + - Heap (Priority Queue) --- diff --git a/solution/2800-2899/2818.Apply Operations to Maximize Score/README.md b/solution/2800-2899/2818.Apply Operations to Maximize Score/README.md index 3dd8183c6d550..ee4bb08880ec3 100644 --- a/solution/2800-2899/2818.Apply Operations to Maximize Score/README.md +++ b/solution/2800-2899/2818.Apply Operations to Maximize Score/README.md @@ -10,6 +10,7 @@ tags: - 数组 - 数学 - 数论 + - 排序 - 单调栈 --- diff --git a/solution/2800-2899/2818.Apply Operations to Maximize Score/README_EN.md b/solution/2800-2899/2818.Apply Operations to Maximize Score/README_EN.md index 74cd2e23fdaf0..1651882227de2 100644 --- a/solution/2800-2899/2818.Apply Operations to Maximize Score/README_EN.md +++ b/solution/2800-2899/2818.Apply Operations to Maximize Score/README_EN.md @@ -10,6 +10,7 @@ tags: - Array - Math - Number Theory + - Sorting - Monotonic Stack --- diff --git a/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README.md b/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README.md index 1d083afb0f134..9650710a6145c 100644 --- a/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README.md +++ b/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README.md @@ -8,6 +8,7 @@ tags: - 位运算 - 树 - 深度优先搜索 + - 记忆化搜索 - 数组 - 动态规划 --- diff --git a/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README_EN.md b/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README_EN.md index 180b255ead6b9..454bf724a1dc3 100644 --- a/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README_EN.md +++ b/solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README_EN.md @@ -8,6 +8,7 @@ tags: - Bit Manipulation - Tree - Depth-First Search + - Memoization - Array - Dynamic Programming --- diff --git a/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README.md b/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README.md index b8198b0178a64..079b2f6672e4d 100644 --- a/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README.md +++ b/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README.md @@ -22,15 +22,15 @@ tags: -

给你一个 下标从 1 开始的 整数数组 prices ，其中 prices[i] 表示你购买第 i 个水果需要花费的金币数目。

+

给你一个 下标从 0 开始的 整数数组 prices ，其中 prices[i] 表示你购买第 i + 1 个水果需要花费的金币数目。

水果超市有如下促销活动：

-

注意 ，即使你 可以 免费获得水果 j ，你仍然可以花费 prices[j] 个金币去购买它以获得它的奖励。

+

注意 ，即使你 可以 免费获得水果 j ，你仍然可以花费 prices[j - 1] 个金币去购买它以获得它的奖励。

请你返回获得所有水果所需要的 最少 金币数。

diff --git a/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README_EN.md b/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README_EN.md index 0de4665842e66..4d1a074fed470 100644 --- a/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README_EN.md +++ b/solution/2900-2999/2944.Minimum Number of Coins for Fruits/README_EN.md @@ -22,15 +22,15 @@ tags: -

You are given an 1-indexed integer array prices where prices[i] denotes the number of coins needed to purchase the ith fruit.

+

You are given an 0-indexed integer array prices where prices[i] denotes the number of coins needed to purchase the (i + 1)th fruit.

The fruit market has the following reward for each fruit:

-

Note that even if you can take fruit j for free, you can still purchase it for prices[j] coins to receive its reward.

+

Note that even if you can take fruit j for free, you can still purchase it for prices[j - 1] coins to receive its reward.

Return the minimum number of coins needed to acquire all the fruits.

diff --git a/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README.md b/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README.md index 965d09261155c..2dfab72c588b3 100644 --- a/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README.md +++ b/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README.md @@ -7,7 +7,7 @@ tags: - 线段树 - 队列 - 数组 - - 双指针 + - 滑动窗口 - 单调队列 - 单调栈 --- diff --git a/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README_EN.md b/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README_EN.md index 57af007720f84..a0245eb94366a 100644 --- a/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README_EN.md +++ b/solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README_EN.md @@ -7,7 +7,7 @@ tags: - Segment Tree - Queue - Array - - Two Pointers + - Sliding Window - Monotonic Queue - Monotonic Stack --- diff --git a/solution/3400-3499/3421.Find Students Who Improved/README.md b/solution/3400-3499/3421.Find Students Who Improved/README.md index 065e6bcf5d808..57b79dd899685 100644 --- a/solution/3400-3499/3421.Find Students Who Improved/README.md +++ b/solution/3400-3499/3421.Find Students Who Improved/README.md @@ -51,23 +51,22 @@ tags:

Scores 表：

-
+
 +------------+----------+-------+------------+
 | student_id | subject  | score | exam_date  |
 +------------+----------+-------+------------+
-| 101        | Math     | 70    | 15-01-2023 |
-| 101        | Math     | 85    | 15-02-2023 |
-| 101        | Physics  | 65    | 15-01-2023 |
-| 101        | Physics  | 60    | 15-02-2023 |
-| 102        | Math     | 80    | 15-01-2023 |
-| 102        | Math     | 85    | 15-02-2023 |
-| 103        | Math     | 90    | 15-01-2023 |
-| 104        | Physics  | 75    | 15-01-2023 |
-| 104        | Physics  | 85    | 15-02-2023 |
-+------------+----------+-------+------------+
-

-
-
输出：

+| 101        | Math     | 70    | 2023-01-15 |
+| 101        | Math     | 85    | 2023-02-15 |
+| 101        | Physics  | 65    | 2023-01-15 |
+| 101        | Physics  | 60    | 2023-02-15 |
+| 102        | Math     | 80    | 2023-01-15 |
+| 102        | Math     | 85    | 2023-02-15 |
+| 103        | Math     | 90    | 2023-01-15 |
+| 104        | Physics  | 75    | 2023-01-15 |
+| 104        | Physics  | 85    | 2023-02-15 |
++------------+----------+-------+------------+
+ +

出：

 +------------+----------+-------------+--------------+
diff --git a/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README.md b/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README.md
index ad4685f9375f9..7b9fa60eb1194 100644
--- a/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README.md	
+++ b/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README.md	
@@ -2,6 +2,12 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3422.Minimum%20Operations%20to%20Make%20Subarray%20Elements%20Equal/README.md
+tags:
+    - 数组
+    - 哈希表
+    - 数学
+    - 滑动窗口
+    - 堆（优先队列）
 ---
 
 
diff --git a/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README_EN.md b/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README_EN.md
index e95fefe8efd8c..f977614ca0ba3 100644
--- a/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README_EN.md	
+++ b/solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README_EN.md	
@@ -2,6 +2,12 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3422.Minimum%20Operations%20to%20Make%20Subarray%20Elements%20Equal/README_EN.md
+tags:
+    - Array
+    - Hash Table
+    - Math
+    - Sliding Window
+    - Heap (Priority Queue)
 ---
 
 
diff --git a/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md b/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md
index 6427d29761516..2e0d1794e1525 100644
--- a/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md	
+++ b/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md	
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3423.Maximum%20Difference%20Between%20Adjacent%20Elements%20in%20a%20Circular%20Array/README.md
+tags:
+    - 数组
 ---
 
 
diff --git a/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md b/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md
index 20120d148cdcf..b5e13f910529b 100644
--- a/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md	
+++ b/solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md	
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3423.Maximum%20Difference%20Between%20Adjacent%20Elements%20in%20a%20Circular%20Array/README_EN.md
+tags:
+    - Array
 ---
 
 
diff --git a/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README.md b/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README.md
index 252cfff0287ab..d6294fe9f0548 100644
--- a/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README.md	
+++ b/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README.md	
@@ -2,6 +2,10 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3424.Minimum%20Cost%20to%20Make%20Arrays%20Identical/README.md
+tags:
+    - 贪心
+    - 数组
+    - 排序
 ---
 
 
diff --git a/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README_EN.md b/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README_EN.md
index fb0c3dc80f5a1..86f123f324d2a 100644
--- a/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README_EN.md	
+++ b/solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README_EN.md	
@@ -2,6 +2,10 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3424.Minimum%20Cost%20to%20Make%20Arrays%20Identical/README_EN.md
+tags:
+    - Greedy
+    - Array
+    - Sorting
 ---
 
 
@@ -17,7 +21,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3424.Mi
 
You are given two integer arrays arr and brr of length n, and an integer k. You can perform the following operations on arr any number of times: