chore: update lc problems (#1563)

Author: yanglbme

solution/0000-0099/0080.Remove Duplicates from Sorted Array II/README.md

@@ -38,15 +38,15 @@ for (int i = 0; i < len; i++) {
 <pre>
 <strong>输入：</strong>nums = [1,1,1,2,2,3]
 <strong>输出：</strong>5, nums = [1,1,2,2,3]
-<strong>解释：</strong>函数应返回新长度 length = <strong><code>5</code></strong>, 并且原数组的前五个元素被修改为 <strong><code>1, 1, 2, 2,</code></strong> <strong>3 </strong>。 不需要考虑数组中超出新长度后面的元素。
+<strong>解释：</strong>函数应返回新长度 length = <strong><code>5</code></strong>, 并且原数组的前五个元素被修改为 <strong><code>1, 1, 2, 2, 3</code></strong>。 不需要考虑数组中超出新长度后面的元素。
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
 <strong>输入：</strong>nums = [0,0,1,1,1,1,2,3,3]
 <strong>输出：</strong>7, nums = [0,0,1,1,2,3,3]
-<strong>解释：</strong>函数应返回新长度 length = <strong><code>7</code></strong>, 并且原数组的前五个元素被修改为&nbsp;<strong><code>0</code></strong>, <strong>0</strong>, <strong>1</strong>, <strong>1</strong>, <strong>2</strong>, <strong>3</strong>, <strong>3 。</strong> 不需要考虑数组中超出新长度后面的元素。
+<strong>解释：</strong>函数应返回新长度 length = <strong><code>7</code></strong>, 并且原数组的前五个元素被修改为&nbsp;<strong><code>0, 0, 1, 1, 2, 3, 3</code></strong>。不需要考虑数组中超出新长度后面的元素。
 </pre>
 
 <p>&nbsp;</p>

solution/0300-0399/0373.Find K Pairs with Smallest Sums/README.md

@@ -48,7 +48,7 @@
 	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>-10<sup>9</sup> &lt;= nums1[i], nums2[i] &lt;= 10<sup>9</sup></code></li>
 	<li><code>nums1</code> 和 <code>nums2</code> 均为升序排列</li>
-	<li><code>1 &lt;= k &lt;= 1000</code></li>
+	<li><code>1 &lt;= k &lt;= 10<sup>4</sup></code></li>
 </ul>
 
 ## 解法

solution/1100-1199/1174.Immediate Food Delivery II/README_EN.md

@@ -15,7 +15,7 @@
 | order_date                  | date    |
 | customer_pref_delivery_date | date    |
 +-----------------------------+---------+
-delivery_id is the primary key of this table.
+delivery_id is the column of unique values of this table.
 The table holds information about food delivery to customers that make orders at some date and specify a preferred delivery date (on the same order date or after it).
 </pre>
 
@@ -25,9 +25,9 @@ The table holds information about food delivery to customers that make orders at
 
 <p>The <strong>first order</strong> of a customer is the order with the earliest order date that the customer made. It is guaranteed that a customer has precisely one first order.</p>
 
-<p>Write an SQL query to find the percentage of immediate orders in the first orders of all customers, <strong>rounded to 2 decimal places</strong>.</p>
+<p>Write a solution to find the percentage of immediate orders in the first orders of all customers, <strong>rounded to 2 decimal places</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1204.Last Person to Fit in the Bus/README_EN.md

@@ -15,7 +15,7 @@
 | weight      | int     |
 | turn        | int     |
 +-------------+---------+
-person_id is the primary key column for this table.
+person_id column contains unique values.
 This table has the information about all people waiting for a bus.
 The person_id and turn columns will contain all numbers from 1 to n, where n is the number of rows in the table.
 turn determines the order of which the people will board the bus, where turn=1 denotes the first person to board and turn=n denotes the last person to board.
@@ -26,9 +26,9 @@ weight is the weight of the person in kilograms.
 
 <p>There is a queue of people waiting to board a bus. However, the bus has a weight limit of <code>1000</code><strong> kilograms</strong>, so there may be some people who cannot board.</p>
 
-<p>Write an SQL query to find the <code>person_name</code> of the <strong>last person</strong> that can fit on the bus without exceeding the weight limit. The test cases are generated such that the first person does not exceed the weight limit.</p>
+<p>Write a solution to find the <code>person_name</code> of the <strong>last person</strong> that can fit on the bus without exceeding the weight limit. The test cases are generated such that the first person does not exceed the weight limit.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1211.Queries Quality and Percentage/README_EN.md

@@ -15,7 +15,7 @@
 | position    | int     |
 | rating      | int     |
 +-------------+---------+
-There is no primary key for this table, it may have duplicate rows.
+This table may have duplicate rows.
 This table contains information collected from some queries on a database.
 The <code>position</code> column has a value from <strong>1</strong> to <strong>500</strong>.
 The <code>rating</code> column has a value from <strong>1</strong> to <strong>5</strong>. Query with <code>rating</code> less than 3 is a poor query.
@@ -35,13 +35,13 @@ The <code>rating</code> column has a value from <strong>1</strong> to <strong>5<
 <p>The percentage of all queries with rating less than 3.</p>
 </blockquote>
 
-<p>Write an SQL query to find each <code>query_name</code>, the <code>quality</code> and <code>poor_query_percentage</code>.</p>
+<p>Write a solution to find each <code>query_name</code>, the <code>quality</code> and <code>poor_query_percentage</code>.</p>
 
 <p>Both <code>quality</code> and <code>poor_query_percentage</code> should be <strong>rounded to 2 decimal places</strong>.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1212.Team Scores in Football Tournament/README_EN.md

@@ -13,7 +13,7 @@
 | team_id       | int      |
 | team_name     | varchar  |
 +---------------+----------+
-team_id is the primary key of this table.
+team_id is the column with unique values of this table.
 Each row of this table represents a single football team.
 </pre>
 
@@ -31,7 +31,7 @@ Each row of this table represents a single football team.
 | host_goals    | int     |
 | guest_goals   | int     |
 +---------------+---------+
-match_id is the primary key of this table.
+match_id is the column of unique values of this table.
 Each row is a record of a finished match between two different teams. 
 Teams host_team and guest_team are represented by their IDs in the Teams table (team_id), and they scored host_goals and guest_goals goals, respectively.
 </pre>
@@ -45,11 +45,11 @@ You would like to compute the scores of all teams after all matches. Points are
 	<li>A team receives <strong>no points</strong> if they lose a match (i.e., Scored fewer goals than the opponent team).</li>
 </ul>
 
-<p>Write an SQL query that selects the <code>team_id</code>, <code>team_name</code> and <code>num_points</code> of each team in the tournament after all described matches.</p>
+<p>Write a solution that selects the <code>team_id</code>, <code>team_name</code> and <code>num_points</code> of each team in the tournament after all described matches.</p>
 
 <p>Return the result table ordered by <code>num_points</code> <strong>in decreasing order</strong>. In case of a tie, order the records by <code>team_id</code> <strong>in increasing order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1264.Page Recommendations/README_EN.md

@@ -13,7 +13,7 @@
 | user1_id      | int     |
 | user2_id      | int     |
 +---------------+---------+
-(user1_id, user2_id) is the primary key for this table.
+(user1_id, user2_id) is the primary key (combination of columns with unique values) for this table.
 Each row of this table indicates that there is a friendship relation between user1_id and user2_id.
 </pre>
 
@@ -28,17 +28,17 @@ Each row of this table indicates that there is a friendship relation between use
 | user_id     | int     |
 | page_id     | int     |
 +-------------+---------+
-(user_id, page_id) is the primary key for this table.
+(user_id, page_id) is the primary key (combination of columns with unique values) for this table.
 Each row of this table indicates that user_id likes page_id.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to recommend pages to the user with <code>user_id = 1</code> using the pages that your friends liked. It should not recommend pages you already liked.</p>
+<p>Write a solution&nbsp;to recommend pages to the user with <code>user_id = 1</code> using the pages that your friends liked. It should not recommend pages you already liked.</p>
 
 <p>Return result table in <strong>any order</strong> without duplicates.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1270.All People Report to the Given Manager/README_EN.md

@@ -14,20 +14,20 @@
 | employee_name | varchar |
 | manager_id    | int     |
 +---------------+---------+
-employee_id is the primary key for this table.
+employee_id is the column of unique values for this table.
 Each row of this table indicates that the employee with ID employee_id and name employee_name reports his work to his/her direct manager with manager_id
 The head of the company is the employee with employee_id = 1.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find <code>employee_id</code> of all employees that directly or indirectly report their work to the head of the company.</p>
+<p>Write a solution to find <code>employee_id</code> of all employees that directly or indirectly report their work to the head of the company.</p>
 
 <p>The indirect relation between managers <strong>will not exceed three managers</strong> as the company is small.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README_EN.md

@@ -12,17 +12,17 @@
 +---------------+---------+
 | log_id        | int     |
 +---------------+---------+
-log_id is the primary key for this table.
+log_id is the column of unique values for this table.
 Each row of this table contains the ID in a log Table.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find the start and end number of continuous ranges in the table <code>Logs</code>.</p>
+<p>Write a solution to find the start and end number of continuous ranges in the table <code>Logs</code>.</p>
 
 <p>Return the result table ordered by <code>start_id</code>.</p>
 
-<p>The query result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>There is a one-dimensional garden on the x-axis. The garden starts at the point <code>0</code> and ends at the point <code>n</code>. (i.e The length of the garden is <code>n</code>).</p>
+<p>There is a one-dimensional garden on the x-axis. The garden starts at the point <code>0</code> and ends at the point <code>n</code>. (i.e., the&nbsp;length of the garden is <code>n</code>).</p>
 
 <p>There are <code>n + 1</code> taps located at points <code>[0, 1, ..., n]</code> in the garden.</p>
 

solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README.md

@@ -6,22 +6,23 @@
 
 <!-- 这里写题目描述 -->
 
-<p>一张有 <code>n</code> 个节点的无向图以边的列表 <code>edgeList</code> 的形式定义，其中 <code>edgeList[i] = [u<sub>i</sub>, v<sub>i</sub>, dis<sub>i</sub>]</code> 表示一条连接 <code>u<sub>i</sub></code> 和 <code>v<sub>i</sub></code> ，距离为 <code>dis<sub>i</sub></code> 的边。注意，同一对节点间可能有<strong>多条</strong>边，且该图可能不是连通的。</p>
+<p>一张有&nbsp;<code>n</code>&nbsp;个节点的无向图以边的列表&nbsp;<code>edgeList</code>&nbsp;的形式定义，其中&nbsp;<code>edgeList[i] = [u<sub>i</sub>, v<sub>i</sub>, dis<sub>i</sub>]</code>&nbsp;表示一条连接&nbsp;<code>u<sub>i</sub></code>&nbsp;和&nbsp;<code>v<sub>i</sub></code>&nbsp;，距离为&nbsp;<code>dis<sub>i</sub></code>&nbsp;的边。注意，同一对节点间可能有<strong>多条</strong>边，且该图可能不是连通的。</p>
 
-<p>实现 <code>DistanceLimitedPathsExist</code> 类：</p>
+<p>实现&nbsp;<code>DistanceLimitedPathsExist</code>&nbsp;类：</p>
 
 <ul>
-	<li><code>DistanceLimitedPathsExist(int n, int[][] edgeList)</code> 以给定的无向图初始化对象。</li>
-	<li><code>boolean query(int p, int q, int limit)</code> 当存在一条从 <code>p</code> 到 <code>q</code> 的路径，且路径中每条边的距离都<strong>严格小于</strong> <code>limit</code> 时，返回 <code>true</code> ，否则返回 <code>false</code> 。</li>
+	<li><code>DistanceLimitedPathsExist(int n, int[][] edgeList)</code>&nbsp;以给定的无向图初始化对象。</li>
+	<li><code>boolean query(int p, int q, int limit)</code>&nbsp;当存在一条从&nbsp;<code>p</code>&nbsp;到 <code>q</code> 的路径，且路径中每条边的距离都<strong>严格小于</strong> <code>limit</code> 时，返回 <code>true</code> ，否则返回 <code>false</code> 。</li>
 </ul>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><b>示例 1:</b></p>
 
-<p><strong><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/images/messed.png" style="width: 300px; height: 298px;"></strong></p>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/images/1693449815-oSOAxI-%E6%88%AA%E5%B1%8F2023-08-31%2010.43.30.png){:width=400}" style="width: 400px;" /><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/images/1693449815-oSOAxI-%E6%88%AA%E5%B1%8F2023-08-31%2010.43.30.png" style="width: 400px; height: 352px;" /></p>
 
-<pre><b>输入：</b>
+<pre>
+<b>输入：</b>
 ["DistanceLimitedPathsExist", "query", "query", "query", "query"]
 [[6, [[0, 2, 4], [0, 3, 2], [1, 2, 3], [2, 3, 1], [4, 5, 5]]], [2, 3, 2], [1, 3, 3], [2, 0, 3], [0, 5, 6]]
 <b>输出：</b>
@@ -30,15 +31,15 @@
 <b>解释：</b>
 DistanceLimitedPathsExist distanceLimitedPathsExist = new DistanceLimitedPathsExist(6, [[0, 2, 4], [0, 3, 2], [1, 2, 3], [2, 3, 1], [4, 5, 5]]);
 distanceLimitedPathsExist.query(2, 3, 2); // 返回 true。存在一条从 2 到 3 ，距离为 1 的边，
-                                          // 这条边的距离小于 2。
+&nbsp;                                         // 这条边的距离小于 2。
 distanceLimitedPathsExist.query(1, 3, 3); // 返回 false。从 1 到 3 之间不存在每条边的距离都
                                           // <strong>严格</strong>小于 3 的路径。
 distanceLimitedPathsExist.query(2, 0, 3); // 返回 true。存在一条从 2 到 0 的路径，使得每条边的
                                           // 距离 &lt; 3：从 2 到 3 到 0 行进即可。
 distanceLimitedPathsExist.query(0, 5, 6); // 返回 false。从 0 到 5 之间不存在路径。
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
@@ -50,7 +51,7 @@ distanceLimitedPathsExist.query(0, 5, 6); // 返回 false。从 0 到 5 之间
 	<li><code>u<sub>i</sub> != v<sub>i</sub></code></li>
 	<li><code>p != q</code></li>
 	<li><code>1 &lt;= dis<sub>i</sub>, limit &lt;= 10<sup>9</sup></code></li>
-	<li>最多调用 <code>10<sup>4</sup></code> 次 <code>query</code> 。</li>
+	<li>最多调用&nbsp;<code>10<sup>4</sup></code>&nbsp;次&nbsp;<code>query</code>&nbsp;。</li>
 </ul>
 
 ## 解法

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README.md

@@ -163,7 +163,7 @@ function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
         ans = Math.max(ans, arr[i]);
     }
     return ans;
-};
+}
 ```
 
 ### **...**

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/README_EN.md

@@ -151,7 +151,7 @@ function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
         ans = Math.max(ans, arr[i]);
     }
     return ans;
-};
+}
 ```
 
 ### **...**

solution/1800-1899/1846.Maximum Element After Decreasing and Rearranging/Solution.ts

@@ -8,4 +8,4 @@ function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {
         ans = Math.max(ans, arr[i]);
     }
     return ans;
-};
+}

solution/2200-2299/2261.K Divisible Elements Subarrays/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> and two integers <code>k</code> and <code>p</code>, return <em>the number of <strong>distinct subarrays</strong> which have <strong>at most</strong></em> <code>k</code> <em>elements divisible by</em> <code>p</code>.</p>
+<p>Given an integer array <code>nums</code> and two integers <code>k</code> and <code>p</code>, return <em>the number of <strong>distinct subarrays,</strong> which have <strong>at most</strong></em> <code>k</code> <em>elements </em>that are&nbsp;<em>&nbsp;divisible by</em> <code>p</code>.</p>
 
 <p>Two arrays <code>nums1</code> and <code>nums2</code> are said to be <strong>distinct</strong> if:</p>
 

solution/2500-2599/2561.Rearranging Fruits/README_EN.md

@@ -7,7 +7,7 @@
 <p>You have two fruit baskets containing <code>n</code> fruits each. You are given two <strong>0-indexed</strong> integer arrays <code>basket1</code> and <code>basket2</code> representing the cost of fruit in each basket. You want to make both baskets <strong>equal</strong>. To do so, you can use the following operation as many times as you want:</p>
 
 <ul>
-	<li>Chose two indices <code>i</code> and <code>j</code>, and swap the <code>i<sup>th</sup> </code>fruit of <code>basket1</code> with the <code>j<sup>th</sup></code> fruit of <code>basket2</code>.</li>
+	<li>Chose two indices <code>i</code> and <code>j</code>, and swap the <code>i<font size="1">th</font>&nbsp;</code>fruit of <code>basket1</code> with the <code>j<font size="1">th</font></code>&nbsp;fruit of <code>basket2</code>.</li>
 	<li>The cost of the swap is <code>min(basket1[i],basket2[j])</code>.</li>
 </ul>
 

solution/2700-2799/2705.Compact Object/README_EN.md

@@ -36,7 +36,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>obj is a valid JSON object</code></li>
+	<li><code>obj</code> is a valid JSON object</li>
 	<li><code>2 &lt;= JSON.stringify(obj).length &lt;= 10<sup>6</sup></code></li>
 </ul>
 

solution/2700-2799/2710.Remove Trailing Zeros From a String/README.md

@@ -38,6 +38,12 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：遍历**
+
+我们可以从后往前遍历字符串，遇到第一个不是 `0` 的字符时停止遍历，然后返回从头开始到这个字符的子串。
+
+时间复杂度 $O(n)$，其中 $n$ 是字符串的长度。忽略答案字符串的空间消耗，空间复杂度 $O(1)$。
+
 <!-- tabs:start -->
 
 ### **Python3**