feat: add solutions to lc problems: No.2520~2523

* No.2520.Count the Digits That Divide a Number
* No.2521.Distinct Prime Factors of Product of Array
* No.2522.Partition String Into Substrings With Values at Most K
* No.2523.Closest Prime Numbers in Range

Author: yanglbme

solution/0000-0099/0053.Maximum Subarray/README_EN.md

@@ -4,29 +4,31 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code>, find the <span data-keyword="subarray-nonempty">subarray</span> which has the largest sum and return <em>its sum</em>.</p>
+<p>Given an integer array <code>nums</code>, find the <span data-keyword="subarray-nonempty">subarray</span> with the largest sum, and return <em>its sum</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [-2,1,-3,4,-1,2,1,-5,4]
 <strong>Output:</strong> 6
-<strong>Explanation:</strong> [4,-1,2,1] has the largest sum = 6.
+<strong>Explanation:</strong> The subarray [4,-1,2,1] has the largest sum 6.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1]
 <strong>Output:</strong> 1
+<strong>Explanation:</strong> The subarray [1] has the largest sum 1.
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [5,4,-1,7,8]
 <strong>Output:</strong> 23
+<strong>Explanation:</strong> The subarray [5,4,-1,7,8] has the largest sum 23.
 </pre>
 
 <p>&nbsp;</p>

solution/0000-0099/0074.Search a 2D Matrix/README_EN.md

@@ -4,13 +4,17 @@
 
 ## Description
 
-<p>Write an efficient algorithm that searches for a value <code>target</code> in an <code>m x n</code> integer matrix <code>matrix</code>. This matrix has the following properties:</p>
+<p>You are given an <code>m x n</code> integer matrix <code>matrix</code> with the following two properties:</p>
 
 <ul>
-	<li>Integers in each row are sorted from left to right.</li>
+	<li>Each row is sorted in non-decreasing order.</li>
 	<li>The first integer of each row is greater than the last integer of the previous row.</li>
 </ul>
 
+<p>Given an integer <code>target</code>, return <code>true</code> <em>if</em> <code>target</code> <em>is in</em> <code>matrix</code> <em>or</em> <code>false</code> <em>otherwise</em>.</p>
+
+<p>You must write a solution in <code>O(log(m * n))</code> time complexity.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0074.Search%20a%202D%20Matrix/images/mat.jpg" style="width: 322px; height: 242px;" />

solution/0200-0299/0239.Sliding Window Maximum/README_EN.md

@@ -221,7 +221,6 @@ func maxSlidingWindow(nums []int, k int) (ans []int) {
 }
 ```
 
-
 ### **JavaScript**
 
 ```js

solution/0400-0499/0416.Partition Equal Subset Sum/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a <strong>non-empty</strong> array <code>nums</code> containing <strong>only positive integers</strong>, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.</p>
+<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or </em><code>false</code><em> otherwise</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0800-0899/0855.Exam Room/README_EN.md

@@ -122,7 +122,7 @@ class ExamRoom {
         this.n = n;
         add(new int[] {-1, n});
     }
-    
+
     public int seat() {
         int[] s = ts.first();
         int p = (s[0] + s[1]) >> 1;
@@ -136,7 +136,7 @@ class ExamRoom {
         add(new int[] {p, s[1]});
         return p;
     }
-    
+
     public void leave(int p) {
         int l = left.get(p), r = right.get(p);
         del(new int[] {l, p});
@@ -195,7 +195,7 @@ public:
         this->n = n;
         add({-1, n});
     }
-    
+
     int seat() {
         auto s = *ts.begin();
         int p = (s.first + s.second) >> 1;
@@ -209,7 +209,7 @@ public:
         add({p, s.second});
         return p;
     }
-    
+
     void leave(int p) {
         int l = left[p], r = right[p];
         del({l, p});

solution/0800-0899/0886.Possible Bipartition/README_EN.md

@@ -14,21 +14,15 @@
 <pre>
 <strong>Input:</strong> n = 4, dislikes = [[1,2],[1,3],[2,4]]
 <strong>Output:</strong> true
-<strong>Explanation:</strong> group1 [1,4] and group2 [2,3].
+<strong>Explanation:</strong> The first group has [1,4], and the second group has [2,3].
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> n = 3, dislikes = [[1,2],[1,3],[2,3]]
 <strong>Output:</strong> false
-</pre>
-
-<p><strong class="example">Example 3:</strong></p>
-
-<pre>
-<strong>Input:</strong> n = 5, dislikes = [[1,2],[2,3],[3,4],[4,5],[1,5]]
-<strong>Output:</strong> false
+<strong>Explanation:</strong> We need at least 3 groups to divide them. We cannot put them in two groups.
 </pre>
 
 <p>&nbsp;</p>
@@ -38,8 +32,7 @@
 	<li><code>1 &lt;= n &lt;= 2000</code></li>
 	<li><code>0 &lt;= dislikes.length &lt;= 10<sup>4</sup></code></li>
 	<li><code>dislikes[i].length == 2</code></li>
-	<li><code>1 &lt;= dislikes[i][j] &lt;= n</code></li>
-	<li><code>a<sub>i</sub> &lt; b<sub>i</sub></code></li>
+	<li><code>1 &lt;= a<sub>i</sub> &lt; b<sub>i</sub> &lt;= n</code></li>
 	<li>All the pairs of <code>dislikes</code> are <strong>unique</strong>.</li>
 </ul>
 

solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md

@@ -6,29 +6,33 @@
 
 <p><strong>No-Zero integer</strong> is a positive integer that <strong>does not contain any <code>0</code></strong> in its decimal representation.</p>
 
-<p>Given an integer <code>n</code>, return <em>a list of two integers</em> <code>[A, B]</code> <em>where</em>:</p>
+<p>Given an integer <code>n</code>, return <em>a list of two integers</em> <code>[a, b]</code> <em>where</em>:</p>
 
 <ul>
-	<li><code>A</code> and <code>B</code> are <strong>No-Zero integers</strong>.</li>
-	<li><code>A + B = n</code></li>
+	<li><code>a</code> and <code>b</code> are <strong>No-Zero integers</strong>.</li>
+	<li><code>a + b = n</code></li>
 </ul>
 
-<p>The test cases are generated so that there is at least one valid solution. If there are many valid solutions you can return any of them.</p>
+<p>The test cases are generated so that there is at least one valid solution. If there are many valid solutions, you can return any of them.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> n = 2
 <strong>Output:</strong> [1,1]
-<strong>Explanation:</strong> A = 1, B = 1. A + B = n and both A and B do not contain any 0 in their decimal representation.
+<strong>Explanation:</strong> Let a = 1 and b = 1.
+Both a and b are no-zero integers, and a + b = 2 = n.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> n = 11
 <strong>Output:</strong> [2,9]
+<strong>Explanation:</strong> Let a = 2 and b = 9.
+Both a and b are no-zero integers, and a + b = 9 = n.
+Note that there are other valid answers as [8, 3] that can be accepted.
 </pre>
 
 <p>&nbsp;</p>

solution/2200-2299/2208.Minimum Operations to Halve Array Sum/README_EN.md

@@ -36,7 +36,7 @@ Pick the number 20 and reduce it to 10.
 Pick the number 10 and reduce it to 5.
 Pick the number 3 and reduce it to 1.5.
 The final array is [1.5, 8, 5] with a total sum of 1.5 + 8 + 5 = 14.5. 
-The sum of nums has been reduced by 31 - 14.5 = 16.5, which is at least half of the initial sum, 16.5 >= 31/2 = 16.5.
+The sum of nums has been reduced by 31 - 14.5 = 16.5, which is at least half of the initial sum, 16.5 >= 31/2 = 15.5.
 Overall, 3 operations were used so we return 3.
 It can be shown that we cannot reduce the sum by at least half in less than 3 operations.
 </pre>

solution/2300-2399/2355.Maximum Number of Books You Can Take/README.md

@@ -1,61 +1,63 @@
-# [2355. Maximum Number of Books You Can Take](https://leetcode.cn/problems/maximum-number-of-books-you-can-take)
+# [2355. 你能拿走的最大图书数量](https://leetcode.cn/problems/maximum-number-of-books-you-can-take)
 
 [English Version](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>You are given a <strong>0-indexed</strong> integer array <code>books</code> of length <code>n</code> where <code>books[i]</code> denotes the number of books on the <code>i<sup>th</sup></code> shelf of a bookshelf.</p>
+<p>给定一个长度为 <code>n</code> 的<b>&nbsp;下标从 0 开始&nbsp;</b>的整数数组 <code>books</code>，其中 <code>books[i]</code> 表示书架的第 <code>i</code> 个书架上的书的数量。</p>
 
-<p>You are going to take books from a <strong>contiguous</strong> section of the bookshelf spanning from <code>l</code> to <code>r</code> where <code>0 &lt;= l &lt;= r &lt; n</code>. For each index <code>i</code> in the range <code>l &lt;= i &lt; r</code>, you must take <strong>strictly fewer</strong> books from shelf <code>i</code> than shelf <code>i + 1</code>.</p>
+<p>你要从书架&nbsp;<code>l</code> 到 <code>r</code> 的一个&nbsp;<strong>连续&nbsp;</strong>的部分中取书，其中 <code>0 &lt;= l &lt;= r &lt; n</code>。对于 <code>l &lt;= i &lt; r</code> 范围内的每个索引 <code>i</code>，你从书架 <code>i</code>&nbsp;取书的数量必须&nbsp;<strong>严格小于 </strong>你从书架 <code>i + 1</code> 取书的数量。</p>
 
-<p>Return <em>the <strong>maximum</strong> number of books you can take from the bookshelf.</em></p>
+<p>返回<em>你能从书架上拿走的书的&nbsp;<strong>最大&nbsp;</strong>数量。</em></p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><strong>示例 1:</strong></p>
 
 <pre>
-<strong>Input:</strong> books = [8,5,2,7,9]
-<strong>Output:</strong> 19
-<strong>Explanation:</strong>
-- Take 1 book from shelf 1.
-- Take 2 books from shelf 2.
-- Take 7 books from shelf 3.
-- Take 9 books from shelf 4.
-You have taken 19 books, so return 19.
-It can be proven that 19 is the maximum number of books you can take.
+<strong>输入:</strong> books = [8,5,2,7,9]
+<strong>输出:</strong> 19
+<strong>解释:</strong>
+- 从书架 1 上取 1 本书。
+- 从书架 2 上取 2 本书。
+- 从书架 3 上取 7 本书
+- 从书架 4 上取 9 本书
+你已经拿了19本书，所以返回 19。
+可以证明 19 本是你所能拿走的书的最大数量。
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>示例&nbsp;2:</strong></p>
 
 <pre>
-<strong>Input:</strong> books = [7,0,3,4,5]
-<strong>Output:</strong> 12
-<strong>Explanation:</strong>
-- Take 3 books from shelf 2.
-- Take 4 books from shelf 3.
-- Take 5 books from shelf 4.
-You have taken 12 books so return 12.
-It can be proven that 12 is the maximum number of books you can take.
+<strong>输入:</strong> books = [7,0,3,4,5]
+<strong>输出:</strong> 12
+<strong>解释:</strong>
+- 从书架 2 上取 3 本书。
+- 从书架 3 上取 4 本书。
+- 从书架 4 上取 5 本书。
+你已经拿了 12 本书，所以返回 12。
+可以证明 12 本是你所能拿走的书的最大数量。
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong>示例 3:</strong></p>
 
 <pre>
-<strong>Input:</strong> books = [8,2,3,7,3,4,0,1,4,3]
-<strong>Output:</strong> 13
-<strong>Explanation:</strong>
-- Take 1 book from shelf 0.
-- Take 2 books from shelf 1.
-- Take 3 books from shelf 2.
-- Take 7 books from shelf 3.
-You have taken 13 books so return 13.
-It can be proven that 13 is the maximum number of books you can take.
+<strong>输入:</strong> books = [8,2,3,7,3,4,0,1,4,3]
+<strong>输出:</strong> 13
+<strong>解释:</strong>
+- 从书架 0 上取 1 本书。
+- 从书架 1 上取 2 本书。
+- 从书架 2 上取 3 本书。
+- 从书架 3 上取 7 本书。
+你已经拿了 13 本书，所以返回 13。
+可以证明 13 本是你所能拿走的书的最大数量。
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
+
+<p><strong>提示:</strong></p>
 
 <ul>
 	<li><code>1 &lt;= books.length &lt;= 10<sup>5</sup></code></li>

solution/2300-2399/2356.Number of Unique Subjects Taught by Each Teacher/README.md

@@ -1,12 +1,12 @@
-# [2356. Number of Unique Subjects Taught by Each Teacher](https://leetcode.cn/problems/number-of-unique-subjects-taught-by-each-teacher)
+# [2356. 每位教师所教授的科目种类的数量](https://leetcode.cn/problems/number-of-unique-subjects-taught-by-each-teacher)
 
 [English Version](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>Table: <code>Teacher</code></p>
+<p>表: <code>Teacher</code></p>
 
 <pre>
 +-------------+------+
@@ -16,24 +16,25 @@
 | subject_id  | int  |
 | dept_id     | int  |
 +-------------+------+
-(subject_id, dept_id) is the primary key for this table.
-Each row in this table indicates that the teacher with teacher_id teaches the subject subject_id in the department dept_id.
+(subject_id, dept_id) 是该表的主键。
+该表中的每一行都表示带有 teacher_id 的教师在系 dept_id 中教授科目 subject_id。
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the number of unique subjects each teacher teaches in the university.</p>
+<p>写一个 SQL 来查询每位老师在大学里教授的科目种类的数量。</p>
 
-<p>Return the result table in <strong>any order</strong>.</p>
+<p data-group="1-1">以 <strong>任意顺序</strong> 返回结果表。</p>
 
-<p>The query result format is shown in the following example.</p>
+<p>查询结果格式示例如下。</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+
+<p><strong>示例 1:</strong></p>
 
 <pre>
-<strong>Input:</strong> 
-Teacher table:
+<strong>输入:</strong> 
+Teacher 表:
 +------------+------------+---------+
 | teacher_id | subject_id | dept_id |
 +------------+------------+---------+
@@ -45,23 +46,22 @@ Teacher table:
 | 2          | 3          | 1       |
 | 2          | 4          | 1       |
 +------------+------------+---------+
-<strong>Output:</strong>  
+<strong>输出:</strong>  
 +------------+-----+
 | teacher_id | cnt |
 +------------+-----+
 | 1          | 2   |
 | 2          | 4   |
 +------------+-----+
-<strong>Explanation:</strong> 
-Teacher 1:
-  - They teach subject 2 in departments 3 and 4.
-  - They teach subject 3 in department 3.
-Teacher 2:
-  - They teach subject 1 in department 1.
-  - They teach subject 2 in department 1.
-  - They teach subject 3 in department 1.
-  - They teach subject 4 in department 1.
-</pre>
+<strong>解释:</strong> 
+教师 1:
+  - 他在 3、4 系教科目 2。
+  - 他在 3 系教科目 3。
+教师 2:
+  - 他在 1 系教科目 1。
+  - 他在 1 系教科目 2。
+  - 他在 1 系教科目 3。
+  - 他在 1 系教科目 4。</pre>
 
 ## 解法