Skip to content

Commit e21e1a8

Browse files
yanglbmeyanglbme
committed
feat: update lc problems
1 parent c3e4043 commit e21e1a8

File tree

7 files changed

+17
-17
lines changed

7 files changed

+17
-17
lines changed

‎solution/0800-0899/0805.Split Array With Same Average/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212

1313
<p>如果可以完成则返回<code>true</code>&nbsp;， 否则返回 <code>false</code>&nbsp;&nbsp;。</p>
1414

15-
<p><strong>注意：</strong>对于数组<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;, <meta charset="UTF-8" />&nbsp;<code>average(arr)</code>&nbsp;是<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;的所有元素除以<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;长度的和。</p>
15+
<p><strong>注意：</strong>对于数组<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;, <meta charset="UTF-8" />&nbsp;<code>average(arr)</code>&nbsp;是<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;的所有元素的和除以<meta charset="UTF-8" />&nbsp;<code>arr</code>&nbsp;长度。</p>
1616

1717
<p>&nbsp;</p>
1818

‎solution/2400-2499/2470.Number of Subarrays With LCM Equal to K/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -93,11 +93,11 @@ class Solution {
9393
}
9494
return ans;
9595
}
96-
96+
9797
private int lcm(int a, int b) {
9898
return a * b / gcd(a, b);
9999
}
100-
100+
101101
private int gcd(int a, int b) {
102102
return b == 0 ? a : gcd(b, a % b);
103103
}

‎solution/2400-2499/2470.Number of Subarrays With LCM Equal to K/README_EN.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -79,11 +79,11 @@ class Solution {
7979
}
8080
return ans;
8181
}
82-
82+
8383
private int lcm(int a, int b) {
8484
return a * b / gcd(a, b);
8585
}
86-
86+
8787
private int gcd(int a, int b) {
8888
return b == 0 ? a : gcd(b, a % b);
8989
}

‎solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -153,7 +153,7 @@ class Solution {
153153
}
154154
return ans;
155155
}
156-
156+
157157
private int f(List<Integer> t) {
158158
int n = t.size();
159159
List<Integer> alls = new ArrayList<>(t);
@@ -175,7 +175,7 @@ class Solution {
175175
}
176176
return ans;
177177
}
178-
178+
179179
private void swap(int[] arr, int i, int j) {
180180
int t = arr[i];
181181
arr[i] = arr[j];

‎solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README_EN.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -140,7 +140,7 @@ class Solution {
140140
}
141141
return ans;
142142
}
143-
143+
144144
private int f(List<Integer> t) {
145145
int n = t.size();
146146
List<Integer> alls = new ArrayList<>(t);
@@ -162,7 +162,7 @@ class Solution {
162162
}
163163
return ans;
164164
}
165-
165+
166166
private void swap(int[] arr, int i, int j) {
167167
int t = arr[i];
168168
arr[i] = arr[j];

‎solution/README.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2479,10 +2479,10 @@
24792479
| 2466 | [统计构造好字符串的方案数](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md) | | 中等 | 第 91 场双周赛 |
24802480
| 2467 | [树上最大得分和路径](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md) | | 中等 | 第 91 场双周赛 |
24812481
| 2468 | [根据限制分割消息](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md) | | 困难 | 第 91 场双周赛 |
2482-
| 2469 | [温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) | | 简单 | |
2483-
| 2470 | [最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) | | 中等 | |
2484-
| 2471 | [逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) | | 中等 | |
2485-
| 2472 | [不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) | | 困难 | |
2482+
| 2469 | [温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) | | 简单 | 第 319 场周赛 |
2483+
| 2470 | [最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) | | 中等 | 第 319 场周赛 |
2484+
| 2471 | [逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) | | 中等 | 第 319 场周赛 |
2485+
| 2472 | [不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) | | 困难 | 第 319 场周赛 |
24862486

24872487
## 版权
24882488

‎solution/README_EN.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2477,10 +2477,10 @@ Press <kbd>Control</kbd>+<kbd>F</kbd>(or <kbd>Command</kbd>+<kbd>F</kbd> on the
24772477
| 2466 | [Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) | | Medium | Biweekly Contest 91 |
24782478
| 2467 | [Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) | | Medium | Biweekly Contest 91 |
24792479
| 2468 | [Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) | | Hard | Biweekly Contest 91 |
2480-
| 2469 | [Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) | | Easy | |
2481-
| 2470 | [Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) | | Medium | |
2482-
| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) | | Medium | |
2483-
| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) | | Hard | |
2480+
| 2469 | [Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) | | Easy | Weekly Contest 319 |
2481+
| 2470 | [Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) | | Medium | Weekly Contest 319 |
2482+
| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) | | Medium | Weekly Contest 319 |
2483+
| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) | | Hard | Weekly Contest 319 |
24842484

24852485
## Copyright
24862486

0 commit comments

Comments
 (0)