feat: add new lc problems (doocs#4379)

Author: yanglbme

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:
     - 数组
     - 排序
+    - 扫描线
     - 堆（优先队列）
 ---