chore: update lc problems (doocs#1415)

Author: yanglbme

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -44,7 +44,7 @@
 </ul>
 
 <p>&nbsp;</p>
-<strong>Follow-up:&nbsp;</strong>Can you come up with an algorithm that is less than&nbsp;<code>O(n<sup>2</sup>)&nbsp;</code>time complexity?
+<strong>Follow-up:&nbsp;</strong>Can you come up with an algorithm that is less than <code>O(n<sup>2</sup>)</code><font face="monospace">&nbsp;</font>time complexity?
 
 ## Solutions
 

solution/0000-0099/0095.Unique Binary Search Trees II/README.md

@@ -211,7 +211,7 @@ public:
 //   pub left: Option<Rc<RefCell<TreeNode>>>,
 //   pub right: Option<Rc<RefCell<TreeNode>>>,
 // }
-// 
+//
 // impl TreeNode {
 //   #[inline]
 //   pub fn new(val: i32) -> Self {

solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md

@@ -197,7 +197,7 @@ public:
 //   pub left: Option<Rc<RefCell<TreeNode>>>,
 //   pub right: Option<Rc<RefCell<TreeNode>>>,
 // }
-// 
+//
 // impl TreeNode {
 //   #[inline]
 //   pub fn new(val: i32) -> Self {

solution/0100-0199/0176.Second Highest Salary/README_EN.md

@@ -13,13 +13,13 @@
 | id          | int  |
 | salary      | int  |
 +-------------+------+
-In SQL, id is the primary key column for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table contains information about the salary of an employee.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find&nbsp;the second highest salary from the <code>Employee</code> table. If there is no second highest salary,&nbsp;return&nbsp;<code>null (return&nbsp;None in Pandas)</code>.</p>
+<p>Write a solution to find&nbsp;the second highest salary from the <code>Employee</code> table. If there is no second highest salary,&nbsp;return&nbsp;<code>null (return&nbsp;None in Pandas)</code>.</p>
 
 <p>The result format is in the following example.</p>
 

solution/0100-0199/0177.Nth Highest Salary/README_EN.md

@@ -13,13 +13,13 @@
 | id          | int  |
 | salary      | int  |
 +-------------+------+
-In SQL, id is the primary key column for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table contains information about the salary of an employee.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, return&nbsp;<code>null</code>.</p>
+<p>Write a solution to find the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, return&nbsp;<code>null</code>.</p>
 
 <p>The result format is in the following example.</p>
 

solution/0100-0199/0178.Rank Scores/README_EN.md

@@ -13,13 +13,13 @@
 | id          | int     |
 | score       | decimal |
 +-------------+---------+
-In SQL, id is the primary key for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table contains the score of a game. Score is a floating point value with two decimal places.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find the rank of the scores. The ranking should be calculated according to the following rules:</p>
+<p>Write a solution to find the rank of the scores. The ranking should be calculated according to the following rules:</p>
 
 <ul>
 	<li>The scores should be ranked from the highest to the lowest.</li>

solution/0100-0199/0180.Consecutive Numbers/README.md

@@ -15,15 +15,16 @@
 | id          | int     |
 | num         | varchar |
 +-------------+---------+
-id 是这个表的主键。</pre>
+在 SQL 中，id 是该表的主键。
+id 是一个自增列。</pre>
 
 <p>&nbsp;</p>
 
-<p>编写一个 SQL 查询，查找所有至少连续出现三次的数字。</p>
+<p>找出所有至少连续出现三次的数字。</p>
 
 <p>返回的结果表中的数据可以按 <strong>任意顺序</strong> 排列。</p>
 
-<p>查询结果格式如下面的例子所示：</p>
+<p>结果格式如下面的例子所示：</p>
 
 <p>&nbsp;</p>
 
@@ -33,7 +34,7 @@ id 是这个表的主键。</pre>
 <strong>输入：</strong>
 Logs 表：
 +----+-----+
-| Id | Num |
+| id | num |
 +----+-----+
 | 1  | 1   |
 | 2  | 1   |

solution/0100-0199/0183.Customers Who Never Order/README_EN.md

@@ -13,7 +13,7 @@
 | id          | int     |
 | name        | varchar |
 +-------------+---------+
-In SQL, id is the primary key column for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table indicates the ID and name of a customer.
 </pre>
 
@@ -28,14 +28,14 @@ Each row of this table indicates the ID and name of a customer.
 | id          | int  |
 | customerId  | int  |
 +-------------+------+
-In SQL, id is the primary key column for this table.
-customerId is a foreign key (join key in Pandas) of the ID from the Customers table.
+id is the primary key (column with unique values) for this table.
+customerId is a foreign key (reference columns) of the ID from the Customers table.
 Each row of this table indicates the ID of an order and the ID of the customer who ordered it.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find all customers who never order anything.</p>
+<p>Write a solution to find all customers who never order anything.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 

solution/0100-0199/0184.Department Highest Salary/README_EN.md

@@ -15,8 +15,8 @@
 | salary       | int     |
 | departmentId | int     |
 +--------------+---------+
-In SQL, id is the primary key column for this table.
-departmentId is a foreign key (join key in Pandas) of the ID from the <code>Department </code>table.
+id is the primary key (column with unique values) for this table.
+departmentId is a foreign key (reference columns) of the ID from the <code>Department </code>table.
 Each row of this table indicates the ID, name, and salary of an employee. It also contains the ID of their department.
 </pre>
 
@@ -31,13 +31,13 @@ Each row of this table indicates the ID, name, and salary of an employee. It als
 | id          | int     |
 | name        | varchar |
 +-------------+---------+
-In SQL, id is the primary key column for this table. It is guaranteed that department name is not <code>NULL.</code>
+id is the primary key (column with unique values) for this table. It is guaranteed that department name is not <code>NULL.</code>
 Each row of this table indicates the ID of a department and its name.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find employees who have the highest salary in each of the departments.</p>
+<p>Write a solution to find employees who have the highest salary in each of the departments.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 

solution/0100-0199/0196.Delete Duplicate Emails/README_EN.md

@@ -13,13 +13,13 @@
 | id          | int     |
 | email       | varchar |
 +-------------+---------+
-In SQL, id is the primary key column for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table contains an email. The emails will not contain uppercase letters.
 </pre>
 
 <p>&nbsp;</p>
 
-<p><strong>Delete</strong> all the duplicate emails, keeping only one unique email with the smallest <code>id</code>.</p>
+<p>Write a solution to<strong> delete</strong> all duplicate emails, keeping only one unique email with the smallest <code>id</code>.</p>
 
 <p>For SQL users, please note that you are supposed to write a <code>DELETE</code> statement and not a <code>SELECT</code> one.</p>
 

solution/0100-0199/0197.Rising Temperature/README.md

@@ -18,20 +18,20 @@
 | recordDate    | date    |
 | temperature   | int     |
 +---------------+---------+
-id 是这个表的主键
+在 SQL 中，id 是该表的主键。
 该表包含特定日期的温度信息</pre>
 
 <p>&nbsp;</p>
 
-<p>编写一个 SQL 查询，来查找与之前（昨天的）日期相比温度更高的所有日期的 <code>id</code> 。</p>
+<p>找出与之前（昨天的）日期相比温度更高的所有日期的 <code>id</code> 。</p>
 
-<p>返回结果 <strong>不要求顺序</strong> 。</p>
+<p>返回结果 <strong>无顺序要求</strong> 。</p>
 
-<p>查询结果格式如下例。</p>
+<p>结果格式如下例子所示。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
 <code><strong>输入：</strong>

solution/0300-0399/0399.Evaluate Division/README.md

@@ -14,9 +14,11 @@
 
 <p><strong>注意：</strong>输入总是有效的。你可以假设除法运算中不会出现除数为 0 的情况，且不存在任何矛盾的结果。</p>
 
-<p> </p>
+<p><strong>注意：</strong>未在等式列表中出现的变量是未定义的，因此无法确定它们的答案。</p>
 
-<p><strong>示例 1：</strong></p>
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
 <strong>输入：</strong>equations = [["a","b"],["b","c"]], values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
@@ -25,35 +27,35 @@
 条件：<em>a / b = 2.0</em>, <em>b / c = 3.0</em>
 问题：<em>a / c = ?</em>, <em>b / a = ?</em>, <em>a / e = ?</em>, <em>a / a = ?</em>, <em>x / x = ?</em>
 结果：[6.0, 0.5, -1.0, 1.0, -1.0 ]
-</pre>
+注意：x 是未定义的 =&gt; -1.0</pre>
 
-<p><strong>示例 2：</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
 <strong>输入：</strong>equations = [["a","b"],["b","c"],["bc","cd"]], values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
 <strong>输出：</strong>[3.75000,0.40000,5.00000,0.20000]
 </pre>
 
-<p><strong>示例 3：</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
 <pre>
 <strong>输入：</strong>equations = [["a","b"]], values = [0.5], queries = [["a","b"],["b","a"],["a","c"],["x","y"]]
 <strong>输出：</strong>[0.50000,2.00000,-1.00000,-1.00000]
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= equations.length <= 20</code></li>
+	<li><code>1 &lt;= equations.length &lt;= 20</code></li>
 	<li><code>equations[i].length == 2</code></li>
-	<li><code>1 <= A<sub>i</sub>.length, B<sub>i</sub>.length <= 5</code></li>
+	<li><code>1 &lt;= A<sub>i</sub>.length, B<sub>i</sub>.length &lt;= 5</code></li>
 	<li><code>values.length == equations.length</code></li>
-	<li><code>0.0 < values[i] <= 20.0</code></li>
-	<li><code>1 <= queries.length <= 20</code></li>
+	<li><code>0.0 &lt; values[i] &lt;= 20.0</code></li>
+	<li><code>1 &lt;= queries.length &lt;= 20</code></li>
 	<li><code>queries[i].length == 2</code></li>
-	<li><code>1 <= C<sub>j</sub>.length, D<sub>j</sub>.length <= 5</code></li>
+	<li><code>1 &lt;= C<sub>j</sub>.length, D<sub>j</sub>.length &lt;= 5</code></li>
 	<li><code>A<sub>i</sub>, B<sub>i</sub>, C<sub>j</sub>, D<sub>j</sub></code> 由小写英文字母与数字组成</li>
 </ul>
 

solution/0400-0499/0427.Construct Quad Tree/README_EN.md

@@ -50,7 +50,7 @@ class Node {
 <strong>Input:</strong> grid = [[0,1],[1,0]]
 <strong>Output:</strong> [[0,1],[1,0],[1,1],[1,1],[1,0]]
 <strong>Explanation:</strong> The explanation of this example is shown below:
-Notice that 0 represnts False and 1 represents True in the photo representing the Quad-Tree.
+Notice that 0 represents False and 1 represents True in the photo representing the Quad-Tree.
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0427.Construct%20Quad%20Tree/images/e1tree.png" style="width: 777px; height: 186px;" />
 </pre>
 

solution/0500-0599/0511.Game Play Analysis I/README_EN.md

@@ -15,14 +15,14 @@
 | event_date   | date    |
 | games_played | int     |
 +--------------+---------+
-In SQL, (player_id, event_date) is the primary key of this table.
+(player_id, event_date) is the primary key (combination of columns with unique values) of this table.
 This table shows the activity of players of some games.
 Each row is a record of a player who logged in and played a number of games (possibly 0) before logging out on someday using some device.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find the <strong>first login date</strong> for each player.</p>
+<p>Write a solution to find the <strong>first login date</strong> for each player.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 

solution/0500-0599/0512.Game Play Analysis II/README_EN.md

@@ -15,18 +15,18 @@
 | event_date   | date    |
 | games_played | int     |
 +--------------+---------+
-(player_id, event_date) is the primary key of this table.
+(player_id, event_date) is the primary key (combination of columns with unique values) of this table.
 This table shows the activity of players of some games.
 Each row is a record of a player who logged in and played a number of games (possibly 0) before logging out on someday using some device.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the <strong>device</strong> that is first logged in for each player.</p>
+<p>Write a solution to report the <strong>device</strong> that is first logged in for each player.</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/0500-0599/0570.Managers with at Least 5 Direct Reports/README_EN.md

@@ -15,15 +15,15 @@
 | department  | varchar |
 | managerId   | int     |
 +-------------+---------+
-In SQL, id is the primary key column for this table.
+id is the primary key (column with unique values) for this table.
 Each row of this table indicates the name of an employee, their department, and the id of their manager.
 If managerId is null, then the employee does not have a manager.
 No employee will be the manager of themself.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find the managers with at least <strong>five direct reports</strong>.</p>
+<p>Write a solution to find managers with at least <strong>five direct reports</strong>.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 

solution/0500-0599/0584.Find Customer Referee/README.md

@@ -6,35 +6,51 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定表 <code>customer</code> ，里面保存了所有客户信息和他们的推荐人。</p>
+<p>表:&nbsp;<code>Customer</code></p>
 
 <pre>
-+------+------+-----------+
-| id   | name | referee_id|
-+------+------+-----------+
-|    1 | Will |      NULL |
-|    2 | Jane |      NULL |
-|    3 | Alex |         2 |
-|    4 | Bill |      NULL |
-|    5 | Zack |         1 |
-|    6 | Mark |         2 |
-+------+------+-----------+
-</pre>
-
-<p>写一个查询语句，返回一个客户列表，列表中客户的推荐人的编号都 <strong>不是 </strong>2。</p>
-
-<p>对于上面的示例数据，结果为：</p>
++-------------+---------+
+| Column Name | Type    |
++-------------+---------+
+| id          | int     |
+| name        | varchar |
+| referee_id  | int     |
++-------------+---------+
+在 SQL 中，id 是该表的主键列。
+该表的每一行表示一个客户的 id、姓名以及推荐他们的客户的 id。</pre>
+
+<p>找出那些 <strong>没有被</strong> <code>id = 2</code> 的客户 <strong>推荐</strong> 的客户的姓名。</p>
+
+<p>以 <strong>任意顺序</strong> 返回结果表。</p>
+
+<p>结果格式如下所示。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
 
 <pre>
+<b>输入：</b> 
+Customer 表:
++----+------+------------+
+| id | name | referee_id |
++----+------+------------+
+| 1  | Will | null       |
+| 2  | Jane | null       |
+| 3  | Alex | 2          |
+| 4  | Bill | null       |
+| 5  | Zack | 1          |
+| 6  | Mark | 2          |
++----+------+------------+
+<b>输出：</b>
 +------+
 | name |
 +------+
 | Will |
 | Jane |
 | Bill |
 | Zack |
-+------+
-</pre>
++------+</pre>
 
 ## 解法