feat: add new lc problems

Author: bingoxmind

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

@@ -17,7 +17,9 @@ tags:
 
 <!-- description:start -->
 
-<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>给你两个字符串 <code>s</code><strong> </strong>和 <code>t</code> ，统计并返回在 <code>s</code> 的 <strong>子序列</strong> 中 <code>t</code> 出现的个数。</p>
+
+<p>测试用例保证结果在 32 位有符号整数范围内。</p>
 
 <p>&nbsp;</p>
 

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

@@ -25,13 +25,13 @@ tags:
 | id          | int  |
 | salary      | int  |
 +-------------+------+
-在 SQL 中，id 是该表的主键。
+id 是该表的主键（列中的值互不相同）。
 该表的每一行都包含有关员工工资的信息。
 </pre>
 
 <p>&nbsp;</p>
 
-<p>查询&nbsp;<code>Employee</code> 表中第 <code>n</code> 高的工资。如果没有第 <code>n</code> 个最高工资，查询结果应该为&nbsp;<code>null</code> 。</p>
+<p>编写一个解决方案查询&nbsp;<code>Employee</code> 表中第 <code>n</code> 高的&nbsp;<strong>不同</strong> 工资。如果少于&nbsp;<code>n</code> 个不同工资，查询结果应该为&nbsp;<code>null</code> 。</p>
 
 <p>查询结果格式如下所示。</p>
 

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

@@ -31,7 +31,7 @@ Each row of this table contains information about the salary of an employee.
 
 <p>&nbsp;</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>Write a solution to find the <code>n<sup>th</sup></code> highest <strong>distinct</strong> salary from the <code>Employee</code> table. If there are less than <code>n</code> distinct salaries, return&nbsp;<code>null</code>.</p>
 
 <p>The result format is in the following example.</p>
 

solution/0200-0299/0275.H-Index II/README.md

@@ -17,7 +17,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个整数数组 <code>citations</code> ，其中 <code>citations[i]</code> 表示研究者的第 <code>i</code> 篇论文被引用的次数，<code>citations</code> 已经按照&nbsp;<strong>升序排列&nbsp;</strong>。计算并返回该研究者的 h<strong><em>&nbsp;</em></strong>指数。</p>
+<p>给你一个整数数组 <code>citations</code> ，其中 <code>citations[i]</code> 表示研究者的第 <code>i</code> 篇论文被引用的次数，<code>citations</code> 已经按照&nbsp;<strong>非降序排列&nbsp;</strong>。计算并返回该研究者的 h<strong><em>&nbsp;</em></strong>指数。</p>
 
 <p><a href="https://baike.baidu.com/item/h-index/3991452?fr=aladdin" target="_blank">h 指数的定义</a>：h 代表“高引用次数”（high citations），一名科研人员的 <code>h</code> 指数是指他（她）的 （<code>n</code> 篇论文中）<strong>至少&nbsp;</strong>有 <code>h</code> 篇论文分别被引用了<strong>至少</strong> <code>h</code> 次。</p>
 

solution/0200-0299/0275.H-Index II/README_EN.md

@@ -17,7 +17,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Given an array of integers <code>citations</code> where <code>citations[i]</code> is the number of citations a researcher received for their <code>i<sup>th</sup></code> paper and <code>citations</code> is sorted in <strong>ascending order</strong>, return <em>the researcher&#39;s h-index</em>.</p>
+<p>Given an array of integers <code>citations</code> where <code>citations[i]</code> is the number of citations a researcher received for their <code>i<sup>th</sup></code> paper and <code>citations</code> is sorted in <strong>non-descending order</strong>, return <em>the researcher&#39;s h-index</em>.</p>
 
 <p>According to the <a href="https://en.wikipedia.org/wiki/H-index" target="_blank">definition of h-index on Wikipedia</a>: The h-index is defined as the maximum value of <code>h</code> such that the given researcher has published at least <code>h</code> papers that have each been cited at least <code>h</code> times.</p>
 

solution/0300-0399/0317.Shortest Distance from All Buildings/README.md

@@ -32,8 +32,6 @@ tags:
 
 <p><strong>总旅行距离&nbsp;</strong>是朋友们家到聚会地点的距离之和。</p>
 
-<p>使用 <strong>曼哈顿距离</strong>&nbsp;计算距离，其中距离 <code>(p1, p2) = |p2.x - p1.x | + | p2.y - p1.y |</code> 。</p>
-
 <p>&nbsp;</p>
 
 <p><strong>示例&nbsp; 1：</strong></p>

solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md

@@ -32,8 +32,6 @@ tags:
 
 <p>The <strong>total travel distance</strong> is the sum of the distances between the houses of the friends and the meeting point.</p>
 
-<p>The distance is calculated using <a href="http://en.wikipedia.org/wiki/Taxicab_geometry" target="_blank">Manhattan Distance</a>, where <code>distance(p1, p2) = |p2.x - p1.x| + |p2.y - p1.y|</code>.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/images/buildings-grid.jpg" style="width: 413px; height: 253px;" />

solution/0600-0699/0689.Maximum Sum of 3 Non-Overlapping Subarrays/README.md

@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0689.Ma
 tags:
     - 数组
     - 动态规划
+    - 前缀和
+    - 滑动窗口
 ---
 
 <!-- problem:start -->

solution/0600-0699/0689.Maximum Sum of 3 Non-Overlapping Subarrays/README_EN.md

@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0689.Ma
 tags:
     - Array
     - Dynamic Programming
+    - Prefix Sum
+    - Sliding Window
 ---
 
 <!-- problem:start -->

solution/0700-0799/0759.Employee Free Time/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0700-0799/0759.Em
 tags:
     - 数组
     - 排序
+    - 扫描线
     - 堆（优先队列）
 ---
 

solution/0700-0799/0759.Employee Free Time/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0700-0799/0759.Em
 tags:
     - Array
     - Sorting
+    - Line Sweep
     - Heap (Priority Queue)
 ---
 

solution/0700-0799/0781.Rabbits in Forest/README.md

@@ -31,10 +31,10 @@ tags:
 <strong>输入：</strong>answers = [1,1,2]
 <strong>输出：</strong>5
 <strong>解释：</strong>
-两只回答了 "1" 的兔子可能有相同的颜色，设为红色。
+两只回答了 "1" 的兔子可能有相同的颜色，设为红色。 
 之后回答了 "2" 的兔子不会是红色，否则他们的回答会相互矛盾。
-设回答了 "2" 的兔子为蓝色。
-此外，森林中还应有另外 2 只蓝色兔子的回答没有包含在数组中。
+设回答了 "2" 的兔子为蓝色。 
+此外，森林中还应有另外 2 只蓝色兔子的回答没有包含在数组中。 
 因此森林中兔子的最少数量是 5 只：3 只回答的和 2 只没有回答的。
 </pre>
 

solution/0800-0899/0802.Find Eventual Safe States/README.md

@@ -21,7 +21,7 @@ tags:
 
 <p>有一个有 <code>n</code> 个节点的有向图，节点按 <code>0</code> 到 <code>n - 1</code> 编号。图由一个 <strong>索引从 0 开始</strong> 的 2D 整数数组&nbsp;<code>graph</code>表示，&nbsp;<code>graph[i]</code>是与节点 <code>i</code> 相邻的节点的整数数组，这意味着从节点 <code>i</code> 到&nbsp;<code>graph[i]</code>中的每个节点都有一条边。</p>
 
-<p>如果一个节点没有连出的有向边，则该节点是 <strong>终端节点</strong> 。如果从该节点开始的所有可能路径都通向 <strong>终端节点</strong> ，则该节点为 <strong>安全节点</strong> 。</p>
+<p>如果一个节点没有连出的有向边，则该节点是 <strong>终端节点</strong> 。如果从该节点开始的所有可能路径都通向 <strong>终端节点</strong> ，则该节点为 <strong>终端节点</strong>（或另一个安全节点）。</p>
 
 <p>返回一个由图中所有 <strong>安全节点</strong> 组成的数组作为答案。答案数组中的元素应当按 <strong>升序</strong> 排列。</p>
 

solution/0900-0999/0949.Largest Time for Given Digits/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0949.La
 tags:
     - 数组
     - 字符串
+    - 回溯
     - 枚举
 ---
 

solution/0900-0999/0949.Largest Time for Given Digits/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0949.La
 tags:
     - Array
     - String
+    - Backtracking
     - Enumeration
 ---
 

solution/1000-1099/1040.Moving Stones Until Consecutive II/README.md

@@ -7,8 +7,8 @@ source: 第 135 场周赛 Q4
 tags:
     - 数组
     - 数学
-    - 双指针
     - 排序
+    - 滑动窗口
 ---
 
 <!-- problem:start -->

solution/1000-1099/1040.Moving Stones Until Consecutive II/README_EN.md

@@ -7,8 +7,8 @@ source: Weekly Contest 135 Q4
 tags:
     - Array
     - Math
-    - Two Pointers
     - Sorting
+    - Sliding Window
 ---
 
 <!-- problem:start -->

solution/1000-1099/1070.Product Sales Analysis III/README_EN.md

@@ -34,7 +34,7 @@ Each row of this table shows a sale on the product product_id in a certain year.
 Note that the price is per unit.
 </pre>
 
-<p>&nbsp;</p>
+<p> </p>
 
 <p>Table: <code>Product</code></p>
 
@@ -49,13 +49,13 @@ product_id is the primary key (column with unique values) of this table.
 Each row of this table indicates the product name of each product.
 </pre>
 
-<p>&nbsp;</p>
+<p> </p>
 
-<p>Write a solution to select&nbsp;the <strong>product id</strong>, <strong>year</strong>, <strong>quantity</strong>, and <strong>price</strong> for the <strong>first year</strong> of every product sold.</p>
+<p>Write a solution to select the <strong>product id</strong>, <strong>year</strong>, <strong>quantity</strong>, and <strong>price</strong> for the <strong>first year</strong> of every product sold. If any product is bought multiple times in its first year, return all sales separately.</p>
 
 <p>Return the resulting table in <strong>any order</strong>.</p>
 
-<p>The&nbsp;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/1100-1199/1148.Article Views I/README.md

@@ -34,9 +34,9 @@ tags:
 
 <p>&nbsp;</p>
 
-<p>请查询出所有浏览过自己文章的作者</p>
+<p>请查询出所有浏览过自己文章的作者。</p>
 
-<p>结果按照 <code>id</code> 升序排列。</p>
+<p>结果按照作者的&nbsp;<code>id</code> 升序排列。</p>
 
 <p>查询结果的格式如下所示：</p>
 

solution/1200-1299/1295.Find Numbers with Even Number of Digits/README.md

@@ -19,7 +19,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个整数数组&nbsp;<code>nums</code>，请你返回其中位数为&nbsp;<strong>偶数</strong>&nbsp;的数字的个数。</p>
+<p>给你一个整数数组&nbsp;<code>nums</code>，请你返回其中包含&nbsp;<strong>偶数</strong>&nbsp;个数位的数字的个数。</p>
 
 <p>&nbsp;</p>
 

solution/1300-1399/1399.Count Largest Group/README.md

@@ -19,45 +19,37 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个整数 <code>n</code>&nbsp;。请你先求出从 <code>1</code>&nbsp;到 <code>n</code> 的每个整数 10 进制表示下的数位和（每一位上的数字相加），然后把数位和相等的数字放到同一个组中。</p>
+<p>给定一个整数 <code>n</code>&nbsp;。</p>
 
-<p>请你统计每个组中的数字数目，并返回数字数目并列最多的组有多少个。</p>
+<p>我们需要根据数字的数位和将 <code>1</code> 到 <code>n</code> 的数字分组。例如，数字 14 和 5 属于 <strong>同一</strong>&nbsp;组，而数字 13 和 3 属于 <strong>不同</strong>&nbsp;组。</p>
+
+<p>返回最大组的数字数量，即元素数量 <strong>最多</strong> 的组。</p>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
-<pre><strong>输入：</strong>n = 13
+<pre>
+<strong>输入：</strong>n = 13
 <strong>输出：</strong>4
 <strong>解释：</strong>总共有 9 个组，将 1 到 13 按数位求和后这些组分别是：
 [1,10]，[2,11]，[3,12]，[4,13]，[5]，[6]，[7]，[8]，[9]。总共有 4 个组拥有的数字并列最多。
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
-<pre><strong>输入：</strong>n = 2
+<pre>
+<strong>输入：</strong>n = 2
 <strong>输出：</strong>2
 <strong>解释：</strong>总共有 2 个大小为 1 的组 [1]，[2]。
 </pre>
 
-<p><strong>示例 3：</strong></p>
-
-<pre><strong>输入：</strong>n = 15
-<strong>输出：</strong>6
-</pre>
-
-<p><strong>示例 4：</strong></p>
-
-<pre><strong>输入：</strong>n = 24
-<strong>输出：</strong>5
-</pre>
-
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 &lt;= n &lt;= 10^4</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
 </ul>
 
 <!-- description:end -->

solution/1300-1399/1399.Count Largest Group/README_EN.md

@@ -21,9 +21,9 @@ tags:
 
 <p>You are given an integer <code>n</code>.</p>
 
-<p>Each number from <code>1</code> to <code>n</code> is grouped according to the sum of its digits.</p>
+<p>We need to group the numbers from <code>1</code> to <code>n</code> according to the sum of its digits. For example, the numbers 14 and 5 belong to the <strong>same</strong> group, whereas 13 and 3 belong to <strong>different</strong> groups.</p>
 
-<p>Return <em>the number of groups that have the largest size</em>.</p>
+<p>Return the number of groups that have the largest size, i.e. the <strong>maximum</strong> number of elements.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1400-1499/1404.Number of Steps to Reduce a Number in Binary Representation to One/README.md

@@ -7,6 +7,7 @@ source: 第 183 场周赛 Q2
 tags:
     - 位运算
     - 字符串
+    - 模拟
 ---
 
 <!-- problem:start -->

solution/1400-1499/1404.Number of Steps to Reduce a Number in Binary Representation to One/README_EN.md

@@ -7,6 +7,7 @@ source: Weekly Contest 183 Q2
 tags:
     - Bit Manipulation
     - String
+    - Simulation
 ---
 
 <!-- problem:start -->

solution/1500-1599/1508.Range Sum of Sorted Subarray Sums/README.md

@@ -8,6 +8,7 @@ tags:
     - 数组
     - 双指针
     - 二分查找
+    - 前缀和
     - 排序
 ---
 

solution/1500-1599/1508.Range Sum of Sorted Subarray Sums/README_EN.md

@@ -8,6 +8,7 @@ tags:
     - Array
     - Two Pointers
     - Binary Search
+    - Prefix Sum
     - Sorting
 ---
 

solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md

@@ -5,8 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1700-1799/1778.Sh
 tags:
     - 深度优先搜索
     - 广度优先搜索
-    - 图
+    - 数组
     - 交互
+    - 矩阵
 ---
 
 <!-- problem:start -->

solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md

@@ -5,8 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1700-1799/1778.Sh
 tags:
     - Depth-First Search
     - Breadth-First Search
-    - Graph
+    - Array
     - Interactive
+    - Matrix
 ---
 
 <!-- problem:start -->

solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README.md

@@ -6,7 +6,10 @@ tags:
     - 深度优先搜索
     - 广度优先搜索
     - 图
+    - 数组
     - 交互
+    - 矩阵
+    - 最短路
     - 堆（优先队列）
 ---
 

solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README_EN.md

@@ -6,7 +6,10 @@ tags:
     - Depth-First Search
     - Breadth-First Search
     - Graph
+    - Array
     - Interactive
+    - Matrix
+    - Shortest Path
     - Heap (Priority Queue)
 ---
 

solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md

@@ -36,7 +36,7 @@ tags:
 <strong>Output:</strong> [[1,3],[4,6]]
 <strong>Explanation:
 </strong>For nums1, nums1[1] = 2 is present at index 0 of nums2, whereas nums1[0] = 1 and nums1[2] = 3 are not present in nums2. Therefore, answer[0] = [1,3].
-For nums2, nums2[0] = 2 is present at index 1 of nums1, whereas nums2[1] = 4 and nums2[2] = 6 are not present in nums2. Therefore, answer[1] = [4,6].</pre>
+For nums2, nums2[0] = 2 is present at index 1 of nums1, whereas nums2[1] = 4 and nums2[2] = 6 are not present in nums1. Therefore, answer[1] = [4,6].</pre>
 
 <p><strong class="example">Example 2:</strong></p>
 

solution/2300-2399/2338.Count the Number of Ideal Arrays/README.md

@@ -53,7 +53,7 @@ tags:
 <strong>输出：</strong>11
 <strong>解释：</strong>存在以下理想数组：
 - 以 1 开头的数组（9 个）：
-   - 不含其他不同值（1 个）：[1,1,1,1,1]
+   - 不含其他不同值（1 个）：[1,1,1,1,1] 
    - 含一个不同值 2（4 个）：[1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
    - 含一个不同值 3（4 个）：[1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
 - 以 2 开头的数组（1 个）：[2,2,2,2,2]

solution/2300-2399/2338.Count the Number of Ideal Arrays/README_EN.md

@@ -53,8 +53,8 @@ There are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.
 <strong>Input:</strong> n = 5, maxValue = 3
 <strong>Output:</strong> 11
 <strong>Explanation:</strong> The following are the possible ideal arrays:
-- Arrays starting with the value 1 (9 arrays):
-   - With no other distinct values (1 array): [1,1,1,1,1]
+- Arrays starting with the value 1 (9 arrays): 
+   - With no other distinct values (1 array): [1,1,1,1,1] 
    - With 2<sup>nd</sup> distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
    - With 2<sup>nd</sup> distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
 - Arrays starting with the value 2 (1 array): [2,2,2,2,2]
@@ -92,8 +92,8 @@ $$
 
 where $k$ represents the maximum value of the array, i.e., $\textit{maxValue}$.
 
-- **Time Complexity**: $O(m \times \log^2 m)$
-- **Space Complexity**: $O(m \times \log m)$
+-   **Time Complexity**: $O(m \times \log^2 m)$
+-   **Space Complexity**: $O(m \times \log m)$
 
 <!-- tabs:start -->