feat: add new lc problems and solutions

Author: yanglbme

solution/0100-0199/0182.Duplicate Emails/README.md

@@ -6,29 +6,50 @@
 
 <!-- 这里写题目描述 -->
 
-<p>编写一个 SQL 查询，查找&nbsp;<code>Person</code> 表中所有重复的电子邮箱。</p>
+<p><meta charset="UTF-8" /></p>
+
+<p>表:&nbsp;<code>Person</code></p>
+
+<pre>
++-------------+---------+
+| Column Name | Type    |
++-------------+---------+
+| id          | int     |
+| email       | varchar |
++-------------+---------+
+id 是该表的主键列。
+此表的每一行都包含一封电子邮件。电子邮件不包含大写字母。
+</pre>
+
+<p>&nbsp;</p>
+
+<p>编写一个 SQL 查询来报告所有重复的电子邮件。 请注意，可以保证电子邮件字段不为 NULL。</p>
+
+<p>以&nbsp;<strong>任意顺序&nbsp;</strong>返回结果表。</p>
 
-<p><strong>示例：</strong></p>
+<p>查询结果格式如下例。</p>
 
-<pre>+----+---------+
-| Id | Email   |
+<p>&nbsp;</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre>
+<strong>输入:</strong> 
+Person 表:
++----+---------+
+| id | email   |
 +----+---------+
 | 1  | a@b.com |
 | 2  | c@d.com |
 | 3  | a@b.com |
 +----+---------+
-</pre>
-
-<p>根据以上输入，你的查询应返回以下结果：</p>
-
-<pre>+---------+
+<strong>输出:</strong> 
++---------+
 | Email   |
 +---------+
 | a@b.com |
 +---------+
-</pre>
-
-<p><strong>说明：</strong>所有电子邮箱都是小写字母。</p>
+<strong>解释:</strong> a@b.com 出现了两次。</pre>
 
 ## 解法
 

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

@@ -31,7 +31,7 @@ Each row of this table indicates the ID, name, and salary of an employee. It als
 | id          | int     |
 | name        | varchar |
 +-------------+---------+
-id is the primary key column for this table.
+id is the primary key column 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>
 

solution/0200-0299/0245.Shortest Word Distance III/README.md

@@ -6,20 +6,20 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一个字符串数组&nbsp;<code>wordsDict</code> 和两个字符串 <code>word1</code> 和 <code>word2</code> ，返回列表中这两个单词之间的最短距离。</p>
+<p>给定一个字符串数组&nbsp;<code>wordsDict</code> 和两个字符串 <code>word1</code> 和 <code>word2</code> ，返回这两个单词在列表中出现的最短距离。</p>
 
 <p>注意：<code>word1</code> 和 <code>word2</code>&nbsp;是有可能相同的，并且它们将分别表示为列表中 <strong>两个独立的单词</strong> 。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
 <strong>输入：</strong>wordsDict = ["practice", "makes", "perfect", "coding", "makes"], word1 = "makes", word2 = "coding"
 <strong>输出：</strong>1
 </pre>
 
-<p><strong>示例 2：</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
 <strong>输入：</strong>wordsDict = ["practice", "makes", "perfect", "coding", "makes"], word1 = "makes", word2 = "makes"

solution/0400-0499/0464.Can I Win/README.md

@@ -12,7 +12,7 @@
 
 <p>例如，两个玩家可以轮流从公共整数池中抽取从 1 到 15 的整数（不放回），直到累计整数和 &gt;= 100。</p>
 
-<p>给定两个整数&nbsp;<code>maxChoosableInteger</code>&nbsp;（整数池中可选择的最大数）和&nbsp;<code>desiredTotal</code>（累计和），若先出手的玩家是否能稳赢则返回 <code>true</code>&nbsp;，否则返回 <code>false</code> 。假设两位玩家游戏时都表现 <strong>最佳</strong> 。</p>
+<p>给定两个整数&nbsp;<code>maxChoosableInteger</code>&nbsp;（整数池中可选择的最大数）和&nbsp;<code>desiredTotal</code>（累计和），若先出手的玩家能稳赢则返回 <code>true</code>&nbsp;，否则返回 <code>false</code> 。假设两位玩家游戏时都表现 <strong>最佳</strong> 。</p>
 
 <p>&nbsp;</p>
 

solution/0500-0599/0585.Investments in 2016/README_EN.md

@@ -20,8 +20,8 @@ pid is the primary key column for this table.
 Each row of this table contains information about one policy where:
 pid is the policyholder's policy ID.
 tiv_2015 is the total investment value in 2015 and tiv_2016 is the total investment value in 2016.
-lat is the latitude of the policy holder's city.
-lon is the longitude of the policy holder's city.
+lat is the latitude of the policy holder's city. It's guaranteed that lat is not NULL.
+lon is the longitude of the policy holder's city. It's guaranteed that lon is not NULL.
 </pre>
 
 <p>&nbsp;</p>

solution/0900-0999/0913.Cat and Mouse/README.md

@@ -57,7 +57,7 @@
 	<li><code>0 &lt;= graph[i][j] &lt; graph.length</code></li>
 	<li><code>graph[i][j] != i</code></li>
 	<li><code>graph[i]</code> 互不相同</li>
-	<li>猫和老鼠在游戏中总是移动</li>
+	<li>猫和老鼠在游戏中总是可以移动</li>
 </ul>
 
 ## 解法

solution/1000-1099/1011.Capacity To Ship Packages Within D Days/README_EN.md

@@ -11,78 +11,50 @@
 <p>Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within <code>days</code> days.</p>
 
 <p>&nbsp;</p>
-
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
-
 <strong>Input:</strong> weights = [1,2,3,4,5,6,7,8,9,10], days = 5
-
 <strong>Output:</strong> 15
-
 <strong>Explanation:</strong> A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:
-
 1st day: 1, 2, 3, 4, 5
-
 2nd day: 6, 7
-
 3rd day: 8
-
 4th day: 9
-
 5th day: 10
 
-
-
 Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.
-
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
-
 <strong>Input:</strong> weights = [3,2,2,4,1,4], days = 3
-
 <strong>Output:</strong> 6
-
 <strong>Explanation:</strong> A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:
-
 1st day: 3, 2
-
 2nd day: 2, 4
-
 3rd day: 1, 4
-
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
 
 <pre>
-
 <strong>Input:</strong> weights = [1,2,3,1,1], days = 4
-
 <strong>Output:</strong> 3
-
 <strong>Explanation:</strong>
-
 1st day: 1
-
 2nd day: 2
-
 3rd day: 3
-
 4th day: 1, 1
-
 </pre>
 
 <p>&nbsp;</p>
-
 <p><strong>Constraints:</strong></p>
 
 <ul>
-    <li><code>1 &lt;= days &lt;= weights.length &lt;= 5 * 10<sup>4</sup></code></li>
-    <li><code>1 &lt;= weights[i] &lt;= 500</code></li>
+	<li><code>1 &lt;= days &lt;= weights.length &lt;= 5 * 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= weights[i] &lt;= 500</code></li>
 </ul>
 
 ## Solutions

solution/1000-1099/1031.Maximum Sum of Two Non-Overlapping Subarrays/README.md

@@ -6,51 +6,47 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给出非负整数数组 <code>A</code> ，返回两个非重叠（连续）子数组中元素的最大和，子数组的长度分别为 <code>L</code> 和 <code>M</code>。（这里需要澄清的是，长为 L 的子数组可以出现在长为 M 的子数组之前或之后。）</p>
+<p>给你一个整数数组 <code>nums</code> 和两个整数 <code>firstLen</code> 和 <code>secondLen</code>，请你找出并返回两个非重叠<strong> 子数组 </strong>中元素的最大和<em>，</em>长度分别为 <code>firstLen</code> 和 <code>secondLen</code> 。</p>
 
-<p>从形式上看，返回最大的 <code>V</code>，而 <code>V = (A[i] + A[i+1] + ... + A[i+L-1]) + (A[j] + A[j+1] + ... + A[j+M-1])</code> 并满足下列条件之一：</p>
+<p>长度为 <code>firstLen</code> 的子数组可以出现在长为 <code>secondLen</code> 的子数组之前或之后，但二者必须是不重叠的。</p>
 
-<p>&nbsp;</p>
-
-<ul>
-	<li><code>0 &lt;= i &lt; i + L - 1 &lt; j &lt; j + M - 1 &lt; A.length</code>, <strong>或</strong></li>
-	<li><code>0 &lt;= j &lt; j + M - 1 &lt; i &lt; i + L - 1 &lt; A.length</code>.</li>
-</ul>
+<p>子数组是数组的一个 <strong>连续</strong> 部分。</p>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [0,6,5,2,2,5,1,9,4], L = 1, M = 2
+<strong>输入：</strong>nums = [0,6,5,2,2,5,1,9,4], firstLen = 1, secondLen = 2
 <strong>输出：</strong>20
 <strong>解释：</strong>子数组的一种选择中，[9] 长度为 1，[6,5] 长度为 2。
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [3,8,1,3,2,1,8,9,0], L = 3, M = 2
+<strong>输入：</strong>nums = [3,8,1,3,2,1,8,9,0], firstLen = 3, secondLen = 2
 <strong>输出：</strong>29
 <strong>解释：</strong>子数组的一种选择中，[3,8,1] 长度为 3，[8,9] 长度为 2。
 </pre>
 
 <p><strong>示例 3：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [2,1,5,6,0,9,5,0,3,8], L = 4, M = 3
+<strong>输入：</strong>nums = [2,1,5,6,0,9,5,0,3,8], firstLen = 4, secondLen = 3
 <strong>输出：</strong>31
-<strong>解释：</strong>子数组的一种选择中，[5,6,0,9] 长度为 4，[0,3,8] 长度为 3。</pre>
+<strong>解释：</strong>子数组的一种选择中，[5,6,0,9] 长度为 4，[0,3,8] 长度为 3。
+</pre>
 
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>L &gt;= 1</code></li>
-	<li><code>M &gt;= 1</code></li>
-	<li><code>L + M &lt;= A.length &lt;= 1000</code></li>
-	<li><code>0 &lt;= A[i] &lt;= 1000</code></li>
+	<li><code>1 &lt;= firstLen, secondLen &lt;= 1000</code></li>
+	<li><code>2 &lt;= firstLen + secondLen &lt;= 1000</code></li>
+	<li><code>firstLen + secondLen &lt;= nums.length &lt;= 1000</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 1000</code></li>
 </ul>
 
 ## 解法

solution/1000-1099/1045.Customers Who Bought All Products/README_EN.md

@@ -13,7 +13,7 @@
 | customer_id | int     |
 | product_key | int     |
 +-------------+---------+
-There is no primary key for this table. It may contain duplicates.
+There is no primary key for this table. It may contain duplicates. <code>customer_id</code> is not NULL<code>.</code>
 product_key is a foreign key to <code>Product</code> table.
 </pre>
 

solution/1000-1099/1075.Project Employees I/README_EN.md

@@ -30,7 +30,7 @@ Each row of this table indicates that the employee with employee_id is working o
 | name             | varchar |
 | experience_years | int     |
 +------------------+---------+
-employee_id is the primary key of this table.
+employee_id is the primary key of this table. It's guaranteed that experience_years is not NULL.
 Each row of this table contains information about one employee.
 </pre>
 

solution/1000-1099/1083.Sales Analysis II/README_EN.md

@@ -33,6 +33,8 @@ Each row of this table indicates the name and the price of each product.
 +-------------+---------+
 This table has no primary key, it can have repeated rows.
 product_id is a foreign key to the Product table.
+buyer_id is never NULL. 
+sale_date is never NULL. 
 Each row of this table contains some information about one sale.
 </pre>
 

solution/1100-1199/1105.Filling Bookcase Shelves/README.md

@@ -24,7 +24,7 @@
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
 <p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/images/shelves.png" style="width: 337px; height: 500px;" /></p>
 
@@ -36,7 +36,7 @@
 第 2 本书不必放在第一层书架上。
 </pre>
 
-<p><strong>示例 2:</strong></p>
+<p><strong class="example">示例 2:</strong></p>
 
 <pre>
 <strong>输入:</strong> books = [[1,3],[2,4],[3,2]], shelfWidth = 6

solution/1100-1199/1112.Highest Grade For Each Student/README_EN.md

@@ -15,6 +15,7 @@
 | grade         | int     |
 +---------------+---------+
 (student_id, course_id) is the primary key of this table.
+grade is never NULL.
 </pre>
 
 <p>&nbsp;</p>

solution/1100-1199/1113.Reported Posts/README_EN.md

@@ -19,6 +19,7 @@
 There is no primary key for this table, it may have duplicate rows.
 The action column is an ENUM type of ('view', 'like', 'reaction', 'comment', 'report', 'share').
 The extra column has optional information about the action, such as a reason for the report or a type of reaction.
+extra is never NULL.
 </pre>
 
 <p>&nbsp;</p>

solution/1200-1299/1247.Minimum Swaps to Make Strings Equal/README_EN.md

@@ -39,6 +39,7 @@ Note that you cannot swap s1[0] and s1[1] to make s1 equal to "yx", ca
 
 <ul>
 	<li><code>1 &lt;= s1.length, s2.length &lt;= 1000</code></li>
+	<li><code>s1.length == s2.length</code></li>
 	<li><code>s1, s2</code> only contain <code>&#39;x&#39;</code> or <code>&#39;y&#39;</code>.</li>
 </ul>
 

solution/1500-1599/1506.Find Root of N-Ary Tree/README.md

@@ -6,11 +6,11 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一棵 <a href="https://slack-redir.net/link?url=https%3A%2F%2Fleetcode.com%2Farticles%2Fintroduction-to-n-ary-trees" target="_blank">N 叉树</a> 的所有节点在一个数组  <code>Node[] tree</code> 中，树中每个节点都有 <strong>唯一的值</strong> 。</p>
+<p>给定一棵&nbsp;<a href="https://leetcode.cn/explore/learn/card/n-ary-tree/" target="_blank">N 叉树</a>&nbsp;的所有节点在一个数组&nbsp;&nbsp;<code>Node[] tree</code>&nbsp;中，树中每个节点都有 <strong>唯一的值</strong> 。</p>
 
 <p>找到并返回 N 叉树的 <strong>根节点 </strong>。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>自定义测试：</strong></p>
 
@@ -29,9 +29,9 @@
 	<li>驱动程序代码将接受返回的 <code>Node</code> 对象并对其进行序列化。如果序列化的结果和输入数据 <strong>相同</strong> ，则测试 <strong>通过</strong> 。</li>
 </ul>
 
-<p> </p>
+<p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
 <p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/images/narytreeexample.png" style="width:250px" /></p>
 
@@ -44,7 +44,7 @@
 findRoot 函数应该返回根 Node(1) ，驱动程序代码将序列化它并与输入数据进行比较。
 输入数据和序列化的 Node(1) 相同，因此测试通过。</pre>
 
-<p><strong>示例 2：</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/images/sample_4_964.png" style="height:241px; width:296px" /></p>
 
@@ -53,16 +53,16 @@ findRoot 函数应该返回根 Node(1) ，驱动程序代码将序列化它并
 <strong>输出：</strong>[1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li>节点的总个数在 <code>[1, 5*10^4]</code> 之间。</li>
+	<li>节点的总个数在&nbsp;<code>[1,&nbsp;5*10^4]</code>&nbsp;之间。</li>
 	<li>每个节点都有唯一的值。</li>
 </ul>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>进阶：</strong></p>