chore: update lc problems (doocs#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>