chore: update lc problems (#1379)

Author: yanglbme

solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>You are given the heads of two sorted linked lists <code>list1</code> and <code>list2</code>.</p>
 
-<p>Merge the two lists in a one <strong>sorted</strong> list. The list should be made by splicing together the nodes of the first two lists.</p>
+<p>Merge the two lists into one <strong>sorted</strong> list. The list should be made by splicing together the nodes of the first two lists.</p>
 
 <p>Return <em>the head of the merged linked list</em>.</p>
 

solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md

@@ -6,22 +6,38 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一个二叉树，找出其最大深度。</p>
+<p>给定一个二叉树 <code>root</code> ，返回其最大深度。</p>
 
-<p>二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。</p>
+<p>二叉树的 <strong>最大深度</strong> 是指从根节点到最远叶子节点的最长路径上的节点数。</p>
 
-<p><strong>说明:</strong>&nbsp;叶子节点是指没有子节点的节点。</p>
+<p>&nbsp;</p>
 
-<p><strong>示例：</strong><br>
-给定二叉树 <code>[3,9,20,null,null,15,7]</code>，</p>
+<p><strong>示例 1：</strong></p>
 
-<pre>    3
-   / \
-  9  20
-    /  \
-   15   7</pre>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/images/tmp-tree.jpg" style="width: 400px; height: 277px;" /></p>
 
-<p>返回它的最大深度&nbsp;3 。</p>
+<p>&nbsp;</p>
+
+<pre>
+<b>输入：</b>root = [3,9,20,null,null,15,7]
+<b>输出：</b>3
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>root = [1,null,2]
+<b>输出：</b>2
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>树中节点的数量在&nbsp;<code>[0, 10<sup>4</sup>]</code>&nbsp;区间内。</li>
+	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
+</ul>
 
 ## 解法
 

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

@@ -13,17 +13,17 @@
 | id          | int     |
 | num         | varchar |
 +-------------+---------+
-id is the primary key for this table.
+In SQL, id is the primary key for this table.
 id is an autoincrement column.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find all numbers that appear at least three times consecutively.</p>
+<p>Find all numbers that appear at least three times consecutively.</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/0100-0199/0188.Best Time to Buy and Sell Stock IV/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一个整数数组&nbsp;<code>prices</code> ，它的第<em> </em><code>i</code> 个元素&nbsp;<code>prices[i]</code> 是一支给定的股票在第 <code>i</code><em> </em>天的价格，和一个整型 <code>k</code> 。</p>
+<p>给你一个整数数组&nbsp;<code>prices</code> 和一个整数 <code>k</code> ，其中 <code>prices[i]</code> 是某支给定的股票在第 <code>i</code><em> </em>天的价格。</p>
 
 <p>设计一个算法来计算你所能获取的最大利润。你最多可以完成 <code>k</code> 笔交易。也就是说，你最多可以买 <code>k</code> 次，卖 <code>k</code> 次。</p>
 
@@ -34,8 +34,8 @@
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>0 &lt;= k &lt;= 100</code></li>
-	<li><code>0 &lt;= prices.length &lt;= 1000</code></li>
+	<li><code>1 &lt;= k &lt;= 100</code></li>
+	<li><code>1 &lt;= prices.length &lt;= 1000</code></li>
 	<li><code>0 &lt;= prices[i] &lt;= 1000</code></li>
 </ul>
 

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

@@ -14,17 +14,17 @@
 | recordDate    | date    |
 | temperature   | int     |
 +---------------+---------+
-id is the primary key for this table.
+In SQL, id is the primary key for this table.
 This table contains information about the temperature on a certain day.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find all dates&#39; <code>Id</code> with higher temperatures compared to its previous dates (yesterday).</p>
+<p>Find all dates&#39; <code>Id</code> with higher temperatures compared to its previous dates (yesterday).</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 result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0200-0299/0207.Course Schedule/README.md

@@ -6,17 +6,17 @@
 
 <!-- 这里写题目描述 -->
 
-<p>你这个学期必须选修 <code>numCourses</code> 门课程，记为 <code>0</code> 到 <code>numCourses - 1</code> 。</p>
+<p>你这个学期必须选修 <code>numCourses</code> 门课程，记为&nbsp;<code>0</code>&nbsp;到&nbsp;<code>numCourses - 1</code> 。</p>
 
-<p>在选修某些课程之前需要一些先修课程。 先修课程按数组 <code>prerequisites</code> 给出，其中 <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> ，表示如果要学习课程 <code>a<sub>i</sub></code> 则 <strong>必须</strong> 先学习课程  <code>b<sub>i</sub></code><sub> </sub>。</p>
+<p>在选修某些课程之前需要一些先修课程。 先修课程按数组&nbsp;<code>prerequisites</code> 给出，其中&nbsp;<code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> ，表示如果要学习课程&nbsp;<code>a<sub>i</sub></code> 则 <strong>必须</strong> 先学习课程&nbsp; <code>b<sub>i</sub></code><sub> </sub>。</p>
 
 <ul>
-	<li>例如，先修课程对 <code>[0, 1]</code> 表示：想要学习课程 <code>0</code> ，你需要先完成课程 <code>1</code> 。</li>
+	<li>例如，先修课程对&nbsp;<code>[0, 1]</code> 表示：想要学习课程 <code>0</code> ，你需要先完成课程 <code>1</code> 。</li>
 </ul>
 
 <p>请你判断是否可能完成所有课程的学习？如果可以，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -32,15 +32,15 @@
 <strong>输出：</strong>false
 <strong>解释：</strong>总共有 2 门课程。学习课程 1 之前，你需要先完成​课程 0 ；并且学习课程 0 之前，你还应先完成课程 1 。这是不可能的。</pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= numCourses <= 10<sup>5</sup></code></li>
-	<li><code>0 <= prerequisites.length <= 5000</code></li>
+	<li><code>1 &lt;= numCourses &lt;= 2000</code></li>
+	<li><code>0 &lt;= prerequisites.length &lt;= 5000</code></li>
 	<li><code>prerequisites[i].length == 2</code></li>
-	<li><code>0 <= a<sub>i</sub>, b<sub>i</sub> < numCourses</code></li>
+	<li><code>0 &lt;= a<sub>i</sub>, b<sub>i</sub> &lt; numCourses</code></li>
 	<li><code>prerequisites[i]</code> 中的所有课程对 <strong>互不相同</strong></li>
 </ul>
 

solution/0200-0299/0269.Alien Dictionary/README.md

@@ -6,20 +6,15 @@
 
 <!-- 这里写题目描述 -->
 
-<p>现有一种使用英语字母的火星语言，这门语言的字母顺序与英语顺序不同。</p>
+<p>现有一种使用英语字母的火星语言，这门语言的字母顺序对你来说是未知的。</p>
 
-<p>给你一个字符串列表 <code>words</code> ，作为这门语言的词典，<code>words</code> 中的字符串已经 <strong>按这门新语言的字母顺序进行了排序</strong> 。</p>
+<p>给你一个来自这种外星语言字典的字符串列表 <code>words</code> ，<code>words</code> 中的字符串已经 <strong>按这门新语言的字母顺序进行了排序</strong> 。</p>
 
-<p>请你根据该词典还原出此语言中已知的字母顺序，并 <strong>按字母递增顺序</strong> 排列。若不存在合法字母顺序，返回 <code>""</code> 。若存在多种可能的合法字母顺序，返回其中 <strong>任意一种</strong> 顺序即可。</p>
+<p>如果这种说法是错误的，并且给出的 <code>words</code> 不能对应任何字母的顺序，则返回 <code>""</code> 。</p>
 
-<p>字符串 <code>s</code> <strong>字典顺序小于</strong> 字符串 <code>t</code> 有两种情况：</p>
+<p>否则，返回一个按新语言规则的&nbsp;<strong>字典递增顺序 </strong>排序的独特字符串。如果有多个解决方案，则返回其中 <strong>任意一个</strong> 。</p>
 
-<ul>
-	<li>在第一个不同字母处，如果 <code>s</code> 中的字母在这门外星语言的字母顺序中位于 <code>t</code> 中字母之前，那么 <code>s</code> 的字典顺序小于 <code>t</code> 。</li>
-	<li>如果前面 <code>min(s.length, t.length)</code> 字母都相同，那么 <code>s.length < t.length</code> 时，<code>s</code> 的字典顺序也小于 <code>t</code> 。</li>
-</ul>
-
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -43,13 +38,13 @@
 <strong>解释：</strong>不存在合法字母顺序，因此返回 <code>"" 。</code>
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= words.length <= 100</code></li>
-	<li><code>1 <= words[i].length <= 100</code></li>
+	<li><code>1 &lt;= words.length &lt;= 100</code></li>
+	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
 	<li><code>words[i]</code> 仅由小写英文字母组成</li>
 </ul>
 

solution/0200-0299/0269.Alien Dictionary/README_EN.md

@@ -4,11 +4,13 @@
 
 ## Description
 
-<p>There is a new alien language that uses the English alphabet. However, the order among the letters is unknown to you.</p>
+<p>There is a new alien language that uses the English alphabet. However, the order of the letters is unknown to you.</p>
 
-<p>You are given a list of strings <code>words</code> from the alien language&#39;s dictionary, where the strings in <code>words</code> are <span data-keyword="lexicographically-smaller-string-alien"><strong>sorted lexicographically</strong></span> by the rules of this new language.</p>
+<p>You are given a list of strings <code>words</code> from the alien language&#39;s dictionary. Now it is claimed that the strings in <code>words</code> are <span data-keyword="lexicographically-smaller-string-alien"><strong>sorted lexicographically</strong></span> by the rules of this new language.</p>
 
-<p>Return <em>a string of the unique letters in the new alien language sorted in <strong>lexicographically increasing order</strong> by the new language&#39;s rules. </em>If there is no solution, return <code>&quot;&quot;</code><em>. </em>If there are multiple solutions, return<em> <strong>any of them</strong></em>.</p>
+<p>If this claim is incorrect, and the given arrangement of string in&nbsp;<code>words</code>&nbsp;cannot correspond to any order of letters,&nbsp;return&nbsp;<code>&quot;&quot;.</code></p>
+
+<p>Otherwise, return <em>a string of the unique letters in the new alien language sorted in <strong>lexicographically increasing order</strong> by the new language&#39;s rules</em><em>. </em>If there are multiple solutions, return<em> <strong>any of them</strong></em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0309.Best Time to Buy and Sell Stock with Cooldown/README.md

@@ -1,4 +1,4 @@
-# [309. 最佳买卖股票时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown)
+# [309. 买卖股票的最佳时机含冷冻期](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown)
 
 [English Version](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README_EN.md)
 

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

@@ -12,6 +12,8 @@
 
 <p><strong>Note:</strong> The input is always valid. You may assume that evaluating the queries will not result in division by zero and that there is no contradiction.</p>
 
+<p><strong>Note:&nbsp;</strong>The variables that do not occur in the list of equations are undefined, so the answer cannot be determined for them.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
@@ -20,9 +22,9 @@
 <strong>Output:</strong> [6.00000,0.50000,-1.00000,1.00000,-1.00000]
 <strong>Explanation:</strong> 
 Given: <em>a / b = 2.0</em>, <em>b / c = 3.0</em>
-queries are: <em>a / c = ?</em>, <em>b / a = ?</em>, <em>a / e = ?</em>, <em>a / a = ?</em>, <em>x / x = ?</em>
+queries are: <em>a / c = ?</em>, <em>b / a = ?</em>, <em>a / e = ?</em>, <em>a / a = ?</em>, <em>x / x = ? </em>
 return: [6.0, 0.5, -1.0, 1.0, -1.0 ]
-</pre>
+note: x is undefined =&gt; -1.0</pre>
 
 <p><strong class="example">Example 2:</strong></p>
 

solution/0400-0499/0494.Target Sum/README.md

@@ -6,17 +6,17 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给你一个整数数组 <code>nums</code> 和一个整数 <code>target</code> 。</p>
+<p>给你一个非负整数数组 <code>nums</code> 和一个整数 <code>target</code> 。</p>
 
-<p>向数组中的每个整数前添加 <code>'+'</code> 或 <code>'-'</code> ，然后串联起所有整数，可以构造一个 <strong>表达式</strong> ：</p>
+<p>向数组中的每个整数前添加&nbsp;<code>'+'</code> 或 <code>'-'</code> ，然后串联起所有整数，可以构造一个 <strong>表达式</strong> ：</p>
 
 <ul>
 	<li>例如，<code>nums = [2, 1]</code> ，可以在 <code>2</code> 之前添加 <code>'+'</code> ，在 <code>1</code> 之前添加 <code>'-'</code> ，然后串联起来得到表达式 <code>"+2-1"</code> 。</li>
 </ul>
 
 <p>返回可以通过上述方法构造的、运算结果等于 <code>target</code> 的不同 <strong>表达式</strong> 的数目。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -38,15 +38,15 @@
 <strong>输出：</strong>1
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= nums.length <= 20</code></li>
-	<li><code>0 <= nums[i] <= 1000</code></li>
-	<li><code>0 <= sum(nums[i]) <= 1000</code></li>
-	<li><code>-1000 <= target <= 1000</code></li>
+	<li><code>1 &lt;= nums.length &lt;= 20</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
+	<li><code>0 &lt;= sum(nums[i]) &lt;= 1000</code></li>
+	<li><code>-1000 &lt;= target &lt;= 1000</code></li>
 </ul>
 
 ## 解法

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

@@ -14,17 +14,17 @@
 | name        | varchar |
 | referee_id  | int     |
 +-------------+---------+
-id is the primary key column for this table.
+In SQL, id is the primary key column for this table.
 Each row of this table indicates the id of a customer, their name, and the id of the customer who referred them.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the names of the customer that are <strong>not referred by</strong> the customer with <code>id = 2</code>.</p>
+<p>Find the names of the customer that are <strong>not referred by</strong> the customer with <code>id = 2</code>.</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 result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README_EN.md

@@ -14,7 +14,7 @@
 | send_to_id     | int     |
 | request_date   | date    |
 +----------------+---------+
-There is no primary key for this table, it may contain duplicates.
+This table may contain duplicates (In other words, there is no primary key for this table in SQL).
 This table contains the ID of the user who sent the request, the ID of the user who received the request, and the date of the request.
 </pre>
 
@@ -30,13 +30,13 @@ This table contains the ID of the user who sent the request, the ID of the user
 | accepter_id    | int     |
 | accept_date    | date    |
 +----------------+---------+
-There is no primary key for this table, it may contain duplicates.
+This table may contain duplicates (In other words, there is no primary key for this table in SQL).
 This table contains the ID of the user who sent the request, the ID of the user who received the request, and the date when the request was accepted.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to find the overall acceptance rate of requests, which is the number of acceptance divided by the number of requests. Return the answer rounded to 2 decimals places.</p>
+<p>Find the overall acceptance rate of requests, which is the number of acceptance divided by the number of requests. Return the answer rounded to 2 decimals places.</p>
 
 <p><strong>Note that:</strong></p>
 
@@ -46,7 +46,7 @@ This table contains the ID of the user who sent the request, the ID of the user
 	<li>If there are no requests at all, you should return 0.00 as the <code>accept_rate</code>.</li>
 </ul>
 
-<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>
@@ -87,8 +87,8 @@ There are 4 unique accepted requests, and there are 5 requests in total. So the
 <p><strong>Follow up:</strong></p>
 
 <ul>
-	<li>Could you write a query to return the acceptance rate for every month?</li>
-	<li>Could you write a query to return the cumulative acceptance rate for every day?</li>
+	<li>Could you find the acceptance rate for every month?</li>
+	<li>Could you find the cumulative acceptance rate for every day?</li>
 </ul>
 
 ## Solutions

solution/0600-0699/0603.Consecutive Available Seats/README_EN.md

@@ -13,19 +13,19 @@
 | seat_id     | int  |
 | free        | bool |
 +-------------+------+
-seat_id is an auto-increment primary key column for this table.
+In SQL, seat_id is an auto-increment primary key column for this table.
 Each row of this table indicates whether the i<sup>th</sup> seat is free or not. 1 means free while 0 means occupied.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report all the consecutive available seats in the cinema.</p>
+<p>Find all the consecutive available seats in the cinema.</p>
 
 <p>Return the result table <strong>ordered</strong> by <code>seat_id</code> <strong>in ascending order</strong>.</p>
 
 <p>The test cases are generated so that more than two seats are consecutively available.</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>