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;" />