chore: update lc problems (doocs#1590)

Author: yanglbme

solution/0100-0199/0115.Distinct Subsequences/README.md

@@ -6,9 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给你两个字符串 <code>s</code><strong> </strong>和 <code>t</code> ，统计并返回在 <code>s</code> 的 <strong>子序列</strong> 中 <code>t</code> 出现的个数。</p>
-
-<p>题目数据保证答案符合 32 位带符号整数范围。</p>
+<p>给你两个字符串 <code>s</code><strong> </strong>和 <code>t</code> ，统计并返回在 <code>s</code> 的 <strong>子序列</strong> 中 <code>t</code> 出现的个数，结果需要对&nbsp;10<sup>9</sup> + 7 取模。</p>
 
 <p>&nbsp;</p>
 

solution/0100-0199/0115.Distinct Subsequences/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given two strings <code>s</code> and <code>t</code>, return <em>the number of distinct</em> <span data-keyword="subsequence-string"><strong><em>subsequences</em></strong></span><em> of </em><code>s</code><em> which equals </em><code>t</code>.</p>
+<p>Given two strings s and t, return <i>the number of distinct</i> <b><i>subsequences</i></b><i> of </i>s<i> which equals </i>t.</p>
 
 <p>The test cases are generated so that the answer fits on a 32-bit signed integer.</p>
 

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

@@ -18,12 +18,12 @@
 | recordDate    | date    |
 | temperature   | int     |
 +---------------+---------+
-在 SQL 中，id 是该表的主键。
+id 是该表具有唯一值的列。
 该表包含特定日期的温度信息</pre>
 
 <p>&nbsp;</p>
 
-<p>找出与之前（昨天的）日期相比温度更高的所有日期的 <code>id</code> 。</p>
+<p>编写解决方案，找出与之前（昨天的）日期相比温度更高的所有日期的 <code>id</code> 。</p>
 
 <p>返回结果 <strong>无顺序要求</strong> 。</p>
 

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

@@ -14,13 +14,13 @@
 | recordDate    | date    |
 | temperature   | int     |
 +---------------+---------+
-In SQL, id is the primary key for this table.
+id is the column with unique values for this table.
 This table contains information about the temperature on a certain day.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Find all dates&#39; <code>Id</code> with higher temperatures compared to its previous dates (yesterday).</p>
+<p>Write a solution to 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>
 

solution/0200-0299/0209.Minimum Size Subarray Sum/README.md

@@ -6,18 +6,18 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一个含有 <code>n</code><strong> </strong>个正整数的数组和一个正整数 <code>target</code><strong> 。</strong></p>
+<p>给定一个含有&nbsp;<code>n</code><strong>&nbsp;</strong>个正整数的数组和一个正整数 <code>target</code><strong> 。</strong></p>
 
-<p>找出该数组中满足其和<strong> </strong><code>≥ target</code><strong> </strong>的长度最小的 <strong>连续子数组</strong> <code>[nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub>]</code> ，并返回其长度<strong>。</strong>如果不存在符合条件的子数组，返回 <code>0</code> 。</p>
+<p>找出该数组中满足其总和大于等于<strong> </strong><code>target</code><strong> </strong>的长度最小的 <strong>连续子数组</strong>&nbsp;<code>[nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub>]</code> ，并返回其长度<strong>。</strong>如果不存在符合条件的子数组，返回 <code>0</code> 。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
 <pre>
 <strong>输入：</strong>target = 7, nums = [2,3,1,2,4,3]
 <strong>输出：</strong>2
-<strong>解释：</strong>子数组 <code>[4,3]</code> 是该条件下的长度最小的子数组。
+<strong>解释：</strong>子数组&nbsp;<code>[4,3]</code>&nbsp;是该条件下的长度最小的子数组。
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -34,17 +34,17 @@
 <strong>输出：</strong>0
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= target <= 10<sup>9</sup></code></li>
-	<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
-	<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= target &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
 </ul>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>进阶：</strong></p>
 

solution/0400-0499/0403.Frog Jump/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>A frog is crossing a river. The river is divided into some number of units, and at each unit, there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.</p>
 
-<p>Given a list of <code>stones</code>&#39; positions (in units) in sorted <strong>ascending order</strong>, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be <code>1</code> unit.</p>
+<p>Given a list of <code>stones</code>&nbsp;positions (in units) in sorted <strong>ascending order</strong>, determine if the frog can cross the river by landing on the last stone. Initially, the frog is on the first stone and assumes the first jump must be <code>1</code> unit.</p>
 
 <p>If the frog&#39;s last jump was <code>k</code> units, its next jump must be either <code>k - 1</code>, <code>k</code>, or <code>k + 1</code> units. The frog can only jump in the forward direction.</p>
 

solution/0500-0599/0560.Subarray Sum Equals K/README.md

@@ -8,6 +8,8 @@
 
 <p>给你一个整数数组 <code>nums</code> 和一个整数&nbsp;<code>k</code> ，请你统计并返回 <em>该数组中和为&nbsp;<code>k</code><strong>&nbsp;</strong>的连续子数组的个数&nbsp;</em>。</p>
 
+<p>子数组是数组中元素的连续非空序列。</p>
+
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>

solution/0500-0599/0577.Employee Bonus/README.md

@@ -6,42 +6,75 @@
 
 <!-- 这里写题目描述 -->
 
-<p>选出所有 bonus &lt; 1000 的员工的 name 及其 bonus。</p>
-
-<p><code>Employee</code> 表单</p>
-
-<pre>+-------+--------+-----------+--------+
-| empId |  name  | supervisor| salary |
-+-------+--------+-----------+--------+
-|   1   | John   |  3        | 1000   |
-|   2   | Dan    |  3        | 2000   |
-|   3   | Brad   |  null     | 4000   |
-|   4   | Thomas |  3        | 4000   |
-+-------+--------+-----------+--------+
-empId 是这张表单的主关键字
+<p>表：<code>Employee</code>&nbsp;</p>
+
+<pre>
++-------------+---------+
+| Column Name | Type    |
++-------------+---------+
+| empId       | int     |
+| name        | varchar |
+| supervisor  | int     |
+| salary      | int     |
++-------------+---------+
+empId 是该表中具有唯一值的列。
+该表的每一行都表示员工的姓名和 id，以及他们的工资和经理的 id。
 </pre>
 
-<p><code>Bonus</code> 表单</p>
+<p>&nbsp;</p>
 
-<pre>+-------+-------+
-| empId | bonus |
-+-------+-------+
-| 2     | 500   |
-| 4     | 2000  |
-+-------+-------+
-empId 是这张表单的主关键字
+<p>表：<code>Bonus</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| empId       | int  |
+| bonus       | int  |
++-------------+------+
+empId 是该表具有唯一值的列。
+empId 是 Employee 表中 empId 的外键(reference 列)。
+该表的每一行都包含一个员工的 id 和他们各自的奖金。
 </pre>
 
-<p>输出示例：</p>
+<p>&nbsp;</p>
+
+<p>编写解决方案，报告每个奖金 <strong>少于</strong> <code>1000</code> 的员工的姓名和奖金数额。</p>
+
+<p>以 <strong>任意顺序</strong> 返回结果表。</p>
 
-<pre>+-------+-------+
-| name  | bonus |
+<p>结果格式如下所示。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>
+Employee table:
++-------+--------+------------+--------+
+| empId | name   | supervisor | salary |
++-------+--------+------------+--------+
+| 3     | Brad   | null       | 4000   |
+| 1     | John   | 3          | 1000   |
+| 2     | Dan    | 3          | 2000   |
+| 4     | Thomas | 3          | 4000   |
++-------+--------+------------+--------+
+Bonus table:
++-------+-------+
+| empId | bonus |
 +-------+-------+
-| John  | null  |
-| Dan   | 500   |
-| Brad  | null  |
+| 2     | 500   |
+| 4     | 2000  |
 +-------+-------+
-</pre>
+<b>输出：</b>
++------+-------+
+| name | bonus |
++------+-------+
+| Brad | null  |
+| John | null  |
+| Dan  | 500   |
++------+-------+</pre>
 
 ## 解法
 

solution/0500-0599/0577.Employee Bonus/README_EN.md

@@ -15,7 +15,7 @@
 | supervisor  | int     |
 | salary      | int     |
 +-------------+---------+
-empId is the primary key column for this table.
+empId is the column with unique values for this table.
 Each row of this table indicates the name and the ID of an employee in addition to their salary and the id of their manager.
 </pre>
 
@@ -30,18 +30,18 @@ Each row of this table indicates the name and the ID of an employee in addition
 | empId       | int  |
 | bonus       | int  |
 +-------------+------+
-empId is the primary key column for this table.
-empId is a foreign key to empId from the Employee table.
+empId is the column of unique values for this table.
+empId is a foreign key (reference column) to empId from the Employee table.
 Each row of this table contains the id of an employee and their respective bonus.
 </pre>
 
 <p>&nbsp;</p>
 
-<p>Write an SQL query to report the name and bonus amount of each employee with a bonus <strong>less than</strong> <code>1000</code>.</p>
+<p>Write a solution to report the name and bonus amount of each employee with a bonus <strong>less than</strong> <code>1000</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&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0800-0899/0813.Largest Sum of Averages/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。我们将给定的数组&nbsp;<code>nums</code>&nbsp;分成 <strong>最多</strong>&nbsp;<code>k</code>&nbsp;个相邻的非空子数组 。&nbsp;<strong>分数</strong> 由每个子数组内的平均值的总和构成。</p>
+<p>给定数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。我们将给定的数组&nbsp;<code>nums</code>&nbsp;分成 <strong>最多</strong>&nbsp;<code>k</code>&nbsp;个非空子数组，且数组内部是连续的&nbsp;。&nbsp;<strong>分数</strong> 由每个子数组内的平均值的总和构成。</p>
 
 <p>注意我们必须使用 <code>nums</code> 数组中的每一个数进行分组，并且分数不一定需要是整数。</p>