Skip to content

Commit c461e7b

Browse files
yanglbmeyanglbme
authored
feat: update lc problems (doocs#4002)
1 parent a1122bc commit c461e7b

File tree

49 files changed

+176
-87
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

49 files changed

+176
-87
lines changed

Diff for: ‎solution/0200-0299/0238.Product of Array Except Self/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ tags:
4646
<ul>
4747
<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
4848
<li><code>-30 &lt;= nums[i] &lt;= 30</code></li>
49-
<li><strong>保证</strong> 数组&nbsp;<code>nums</code>之中任意元素的全部前缀元素和后缀的乘积都在&nbsp; <strong>32 位</strong> 整数范围内</li>
49+
<li>输入&nbsp;<strong>保证</strong> 数组&nbsp;<code>answer[i]</code>&nbsp;在&nbsp; <strong>32 位</strong> 整数范围内</li>
5050
</ul>
5151

5252
<p>&nbsp;</p>

Diff for: ‎solution/0500-0599/0554.Brick Wall/README.md

+8-6
Original file line numberDiff line numberDiff line change
@@ -23,10 +23,10 @@ tags:
2323

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

26-
<p> </p>
26+
<p>&nbsp;</p>
2727

2828
<p><strong>示例 1：</strong></p>
29-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/cutwall-grid.jpg" style="width: 493px; height: 577px;" />
29+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/a.png" style="width: 400px; height: 384px;" />
3030
<pre>
3131
<strong>输入：</strong>wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
3232
<strong>输出：</strong>2
@@ -39,15 +39,17 @@ tags:
3939
<strong>输出：</strong>3
4040
</pre>
4141

42+
&nbsp;
43+
4244
<p><strong>提示：</strong></p>
4345

4446
<ul>
4547
<li><code>n == wall.length</code></li>
46-
<li><code>1 <= n <= 10<sup>4</sup></code></li>
47-
<li><code>1 <= wall[i].length <= 10<sup>4</sup></code></li>
48-
<li><code>1 <= sum(wall[i].length) <= 2 * 10<sup>4</sup></code></li>
48+
<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
49+
<li><code>1 &lt;= wall[i].length &lt;= 10<sup>4</sup></code></li>
50+
<li><code>1 &lt;= sum(wall[i].length) &lt;= 2 * 10<sup>4</sup></code></li>
4951
<li>对于每一行 <code>i</code> ，<code>sum(wall[i])</code> 是相同的</li>
50-
<li><code>1 <= wall[i][j] <= 2<sup>31</sup> - 1</code></li>
52+
<li><code>1 &lt;= wall[i][j] &lt;= 2<sup>31</sup> - 1</code></li>
5153
</ul>
5254

5355
<!-- description:end -->

Diff for: ‎solution/0900-0999/0906.Super Palindromes/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@ difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README.md
55
tags:
66
- 数学
7+
- 字符串
78
- 枚举
89
---
910

Diff for: ‎solution/0900-0999/0906.Super Palindromes/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@ difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README_EN.md
55
tags:
66
- Math
7+
- String
78
- Enumeration
89
---
910

Diff for: ‎solution/1000-1099/1023.Camelcase Matching/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ tags:
2424

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

27-
<p>如果可以将<strong>小写字母</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>，那么待查询项与给定模式串匹配。可以在任何位置插入每个字符，也可以不插入字符。</p>
27+
<p>如果可以将&nbsp;<strong>小写字母&nbsp;</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>，那么待查询项与给定模式串匹配。您可以在模式串中的任何位置插入字符，也可以选择不插入任何字符。</p>
2828

2929
<p>&nbsp;</p>
3030

Diff for: ‎solution/1000-1099/1023.Camelcase Matching/README_EN.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ tags:
2424

2525
<p>Given an array of strings <code>queries</code> and a string <code>pattern</code>, return a boolean array <code>answer</code> where <code>answer[i]</code> is <code>true</code> if <code>queries[i]</code> matches <code>pattern</code>, and <code>false</code> otherwise.</p>
2626

27-
<p>A query word <code>queries[i]</code> matches <code>pattern</code> 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.</p>
27+
<p>A query word <code>queries[i]</code> matches <code>pattern</code> 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 <strong>at all</strong>.</p>
2828

2929
<p>&nbsp;</p>
3030
<p><strong class="example">Example 1:</strong></p>

Diff for: ‎solution/1100-1199/1183.Maximum Number of Ones/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@ rating: 2366
66
source: 第 8 场双周赛 Q4
77
tags:
88
- 贪心
9+
- 数学
10+
- 排序
911
- 堆（优先队列）
1012
---
1113

Diff for: ‎solution/1100-1199/1183.Maximum Number of Ones/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@ rating: 2366
66
source: Biweekly Contest 8 Q4
77
tags:
88
- Greedy
9+
- Math
10+
- Sorting
911
- Heap (Priority Queue)
1012
---
1113

Diff for: ‎solution/1400-1499/1400.Construct K Palindrome Strings/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ tags:
2121

2222
<!-- description:start -->
2323

24-
<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个非空 <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
24+
<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个<strong>非空</strong> <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
2525

2626
<p>如果你可以用&nbsp;<code>s</code>&nbsp;中所有字符构造&nbsp;<code>k</code>&nbsp;个回文字符串，那么请你返回 <strong>True</strong>&nbsp;，否则返回&nbsp;<strong>False</strong>&nbsp;。</p>
2727

Diff for: ‎solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ tags:
99
- 数组
1010
- 动态规划
1111
- 矩阵
12+
- 前缀和
1213
---
1314

1415
<!-- problem:start -->

Diff for: ‎solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ tags:
99
- Array
1010
- Dynamic Programming
1111
- Matrix
12+
- Prefix Sum
1213
---
1314

1415
<!-- problem:start -->

Diff for: ‎solution/1400-1499/1467.Probability of a Two Boxes Having The Same Number of Distinct Balls/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -23,13 +23,13 @@ tags:
2323

2424
<!-- description:start -->
2525

26-
<p>桌面上有 <code>2n</code> 个颜色不完全相同的球，球上的颜色共有 <code>k</code> 种。给你一个大小为 <code>k</code> 的整数数组 <code>balls</code> ，其中 <code>balls[i]</code> 是颜色为&nbsp;<code>i</code> 的球的数量。</p>
26+
<p>桌面上有 <code>2n</code> 个颜色不完全相同的球，球的颜色共有 <code>k</code> 种。给你一个大小为 <code>k</code> 的整数数组 <code>balls</code> ，其中 <code>balls[i]</code> 是颜色为&nbsp;<code>i</code> 的球的数量。</p>
2727

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

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

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

3434
<p>&nbsp;</p>
3535

Diff for: ‎solution/2000-2099/2021.Brightest Position on Street/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ tags:
66
- 数组
77
- 有序集合
88
- 前缀和
9+
- 排序
910
---
1011

1112
<!-- problem:start -->

Diff for: ‎solution/2000-2099/2021.Brightest Position on Street/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ tags:
66
- Array
77
- Ordered Set
88
- Prefix Sum
9+
- Sorting
910
---
1011

1112
<!-- problem:start -->

Diff for: ‎solution/2700-2799/2745.Construct the Longest New String/README_EN.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ tags:
3535
<pre>
3636
<strong>Input:</strong> x = 2, y = 5, z = 1
3737
<strong>Output:</strong> 12
38-
<strong>Explanation: </strong>We can concactenate the strings &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, and &quot;AB&quot; in that order. Then, our new string is &quot;BBAABBAABBAB&quot;.
38+
<strong>Explanation: </strong>We can concatenate the strings &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, and &quot;AB&quot; in that order. Then, our new string is &quot;BBAABBAABBAB&quot;.
3939
That string has length 12, and we can show that it is impossible to construct a string of longer length.
4040
</pre>
4141

@@ -44,7 +44,7 @@ That string has length 12, and we can show that it is impossible to construct a
4444
<pre>
4545
<strong>Input:</strong> x = 3, y = 2, z = 2
4646
<strong>Output:</strong> 14
47-
<strong>Explanation:</strong> We can concactenate the strings &quot;AB&quot;, &quot;AB&quot;, &quot;AA&quot;, &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, and &quot;AA&quot; in that order. Then, our new string is &quot;ABABAABBAABBAA&quot;.
47+
<strong>Explanation:</strong> We can concatenate the strings &quot;AB&quot;, &quot;AB&quot;, &quot;AA&quot;, &quot;BB&quot;, &quot;AA&quot;, &quot;BB&quot;, and &quot;AA&quot; in that order. Then, our new string is &quot;ABABAABBAABBAA&quot;.
4848
That string has length 14, and we can show that it is impossible to construct a string of longer length.
4949
</pre>
5050

Diff for: ‎solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,7 @@ source: 第 351 场周赛 Q2
77
tags:
88
- 位运算
99
- 脑筋急转弯
10+
- 枚举
1011
---
1112

1213
<!-- problem:start -->

Diff for: ‎solution/2700-2799/2749.Minimum Operations to Make the Integer Zero/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,7 @@ source: Weekly Contest 351 Q2
77
tags:
88
- Bit Manipulation
99
- Brainteaser
10+
- Enumeration
1011
---
1112

1213
<!-- problem:start -->

Diff for: ‎solution/2800-2899/2812.Find the Safest Path in a Grid/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,7 @@ tags:
1010
- 数组
1111
- 二分查找
1212
- 矩阵
13+
- 堆（优先队列）
1314
---
1415

1516
<!-- problem:start -->

Diff for: ‎solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,7 @@ tags:
1010
- Array
1111
- Binary Search
1212
- Matrix
13+
- Heap (Priority Queue)
1314
---
1415

1516
<!-- problem:start -->

Diff for: ‎solution/2800-2899/2818.Apply Operations to Maximize Score/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,7 @@ tags:
1010
- 数组
1111
- 数学
1212
- 数论
13+
- 排序
1314
- 单调栈
1415
---
1516

Diff for: ‎solution/2800-2899/2818.Apply Operations to Maximize Score/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -10,6 +10,7 @@ tags:
1010
- Array
1111
- Math
1212
- Number Theory
13+
- Sorting
1314
- Monotonic Stack
1415
---
1516

Diff for: ‎solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ tags:
88
- 位运算
99
- 树
1010
- 深度优先搜索
11+
- 记忆化搜索
1112
- 数组
1213
- 动态规划
1314
---

Diff for: ‎solution/2900-2999/2920.Maximum Points After Collecting Coins From All Nodes/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@ tags:
88
- Bit Manipulation
99
- Tree
1010
- Depth-First Search
11+
- Memoization
1112
- Array
1213
- Dynamic Programming
1314
---

Diff for: ‎solution/2900-2999/2944.Minimum Number of Coins for Fruits/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -22,15 +22,15 @@ tags:
2222

2323
<!-- description:start -->
2424

25-
<p>给你一个 <strong>下标从 1 开始的</strong> 整数数组&nbsp;<code>prices</code>&nbsp;，其中&nbsp;<code>prices[i]</code>&nbsp;表示你购买第 <code>i</code>&nbsp;个水果需要花费的金币数目。</p>
25+
<p>给你一个 <strong>下标从 0&nbsp;开始的</strong> 整数数组&nbsp;<code>prices</code>&nbsp;，其中&nbsp;<code>prices[i]</code>&nbsp;表示你购买第 <code>i + 1</code>&nbsp;个水果需要花费的金币数目。</p>
2626

2727
<p>水果超市有如下促销活动：</p>
2828

2929
<ul>
30-
<li>如果你花费 <code>prices[i]</code>&nbsp;购买了下标为&nbsp;<code>i</code>&nbsp;的水果，那么你可以免费获得下标范围在&nbsp;<code>[i + 1, i + i]</code>&nbsp;的水果。</li>
30+
<li>如果你花费 <code>prices[i]</code>&nbsp;购买了下标为&nbsp;<code>i + 1</code>&nbsp;的水果，那么你可以免费获得下标范围在&nbsp;<code>[i + 1, i + i]</code>&nbsp;的水果。</li>
3131
</ul>
3232

33-
<p><strong>注意</strong>&nbsp;，即使你&nbsp;<strong>可以</strong>&nbsp;免费获得水果&nbsp;<code>j</code>&nbsp;，你仍然可以花费&nbsp;<code>prices[j]</code>&nbsp;个金币去购买它以获得它的奖励。</p>
33+
<p><strong>注意</strong>&nbsp;，即使你&nbsp;<strong>可以</strong>&nbsp;免费获得水果&nbsp;<code>j</code>&nbsp;，你仍然可以花费&nbsp;<code>prices[j - 1]</code>&nbsp;个金币去购买它以获得它的奖励。</p>
3434

3535
<p>请你返回获得所有水果所需要的 <strong>最少</strong>&nbsp;金币数。</p>
3636

Diff for: ‎solution/2900-2999/2944.Minimum Number of Coins for Fruits/README_EN.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -22,15 +22,15 @@ tags:
2222

2323
<!-- description:start -->
2424

25-
<p>You are given an <strong>1-indexed</strong> integer array <code>prices</code> where <code>prices[i]</code> denotes the number of coins needed to purchase the <code>i<sup>th</sup></code> fruit.</p>
25+
<p>You are given an <strong>0-indexed</strong> integer array <code>prices</code> where <code>prices[i]</code> denotes the number of coins needed to purchase the <code>(i + 1)<sup>th</sup></code> fruit.</p>
2626

2727
<p>The fruit market has the following reward for each fruit:</p>
2828

2929
<ul>
30-
<li>If you purchase the <code>i<sup>th</sup></code> fruit at <code>prices[i]</code> coins, you can get any number of the next <code>i</code> fruits for free.</li>
30+
<li>If you purchase the <code>(i + 1)<sup>th</sup></code> fruit at <code>prices[i]</code> coins, you can get any number of the next <code>i</code> fruits for free.</li>
3131
</ul>
3232

33-
<p><strong>Note</strong> that even if you <strong>can</strong> take fruit <code>j</code> for free, you can still purchase it for <code>prices[j]</code> coins to receive its reward.</p>
33+
<p><strong>Note</strong> that even if you <strong>can</strong> take fruit <code>j</code> for free, you can still purchase it for <code>prices[j - 1]</code> coins to receive its reward.</p>
3434

3535
<p>Return the <strong>minimum</strong> number of coins needed to acquire all the fruits.</p>
3636

Diff for: ‎solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ tags:
77
- 线段树
88
- 队列
99
- 数组
10-
- 双指针
10+
- 滑动窗口
1111
- 单调队列
1212
- 单调栈
1313
---

Diff for: ‎solution/3400-3499/3420.Count Non-Decreasing Subarrays After K Operations/README_EN.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ tags:
77
- Segment Tree
88
- Queue
99
- Array
10-
- Two Pointers
10+
- Sliding Window
1111
- Monotonic Queue
1212
- Monotonic Stack
1313
---

Diff for: ‎solution/3400-3499/3421.Find Students Who Improved/README.md

+13-14
Original file line numberDiff line numberDiff line change
@@ -51,23 +51,22 @@ tags:
5151

5252
<p>Scores 表：</p>
5353

54-
<pre class="example-io">
54+
<pre>
5555
+------------+----------+-------+------------+
5656
| student_id | subject | score | exam_date |
5757
+------------+----------+-------+------------+
58-
| 101 | Math | 70 | 15-01-2023 |
59-
| 101 | Math | 85 | 15-02-2023 |
60-
| 101 | Physics | 65 | 15-01-2023 |
61-
| 101 | Physics | 60 | 15-02-2023 |
62-
| 102 | Math | 80 | 15-01-2023 |
63-
| 102 | Math | 85 | 15-02-2023 |
64-
| 103 | Math | 90 | 15-01-2023 |
65-
| 104 | Physics | 75 | 15-01-2023 |
66-
| 104 | Physics | 85 | 15-02-2023 |
67-
+------------+----------+-------+------------+
68-
</pre>
69-
70-
<p><strong>输出：</strong></p>
58+
| 101 | Math | 70 | 2023-01-15 |
59+
| 101 | Math | 85 | 2023-02-15 |
60+
| 101 | Physics | 65 | 2023-01-15 |
61+
| 101 | Physics | 60 | 2023-02-15 |
62+
| 102 | Math | 80 | 2023-01-15 |
63+
| 102 | Math | 85 | 2023-02-15 |
64+
| 103 | Math | 90 | 2023-01-15 |
65+
| 104 | Physics | 75 | 2023-01-15 |
66+
| 104 | Physics | 85 | 2023-02-15 |
67+
+------------+----------+-------+------------+</pre>
68+
69+
<p><strong>出：</strong></p>
7170

7271
<pre class="example-io">
7372
+------------+----------+-------------+--------------+

Diff for: ‎solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3422.Minimum%20Operations%20to%20Make%20Subarray%20Elements%20Equal/README.md
5+
tags:
6+
- 数组
7+
- 哈希表
8+
- 数学
9+
- 滑动窗口
10+
- 堆（优先队列）
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3400-3499/3422.Minimum Operations to Make Subarray Elements Equal/README_EN.md

+6
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,12 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3422.Minimum%20Operations%20to%20Make%20Subarray%20Elements%20Equal/README_EN.md
5+
tags:
6+
- Array
7+
- Hash Table
8+
- Math
9+
- Sliding Window
10+
- Heap (Priority Queue)
511
---
612

713
<!-- problem:start -->

Diff for: ‎solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3423.Maximum%20Difference%20Between%20Adjacent%20Elements%20in%20a%20Circular%20Array/README.md
5+
tags:
6+
- 数组
57
---
68

79
<!-- problem:start -->

Diff for: ‎solution/3400-3499/3423.Maximum Difference Between Adjacent Elements in a Circular Array/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
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
5+
tags:
6+
- Array
57
---
68

79
<!-- problem:start -->

Diff for: ‎solution/3400-3499/3424.Minimum Cost to Make Arrays Identical/README.md

+4
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,10 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3424.Minimum%20Cost%20to%20Make%20Arrays%20Identical/README.md
5+
tags:
6+
- 贪心
7+
- 数组
8+
- 排序
59
---
610

711
<!-- problem:start -->

0 commit comments

Comments
 (0)