feat: update lc problems

Author: yanglbme

solution/0000-0099/0028.Find the Index of the First Occurrence in a String/README.md

@@ -41,7 +41,6 @@
 	<li><code>haystack</code> 和 <code>needle</code> 仅由小写英文字符组成</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->

solution/0000-0099/0028.Find the Index of the First Occurrence in a String/README_EN.md

@@ -32,7 +32,6 @@ The first occurrence is at index 0, so we return 0.
 	<li><code>haystack</code> and <code>needle</code> consist of only lowercase English characters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->

solution/0000-0099/0048.Rotate Image/README.md

@@ -202,7 +202,7 @@ func rotate(matrix [][]int) {
 			matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
 		}
 	}
-	
+
 	for i := 0; i < n; i++ {
 		for j, k := 0, n-1; j < k; j, k = j+1, k-1 {
 			matrix[i][j], matrix[i][k] = matrix[i][k], matrix[i][j]

solution/0100-0199/0125.Valid Palindrome/README.md

@@ -6,26 +6,26 @@
 
 <!-- 这里写题目描述 -->
 
-<p>如果在将所有大写字符转换为小写字符、并移除所有非字母数字字符之后，短语正着读和反着读都一样。则可以认为该短语是一个回文串。</p>
+<p>如果在将所有大写字符转换为小写字符、并移除所有非字母数字字符之后，短语正着读和反着读都一样。则可以认为该短语是一个 <strong>回文串</strong> 。</p>
 
 <p>字母和数字都属于字母数字字符。</p>
 
-<p>给你一个字符串 <code>s</code>，如果它是回文串，返回 <code>true</code><em> </em>；否则，返回<em> </em><code>false</code><em> </em>。</p>
+<p>给你一个字符串 <code>s</code>，如果它是 <strong>回文串</strong> ，返回 <code>true</code><em> </em>；否则，返回<em> </em><code>false</code><em> </em>。</p>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
 <pre>
-<strong>输入:</strong> "A man, a plan, a canal: Panama"
+<strong>输入:</strong> s = "A man, a plan, a canal: Panama"
 <strong>输出：</strong>true
 <strong>解释：</strong>"amanaplanacanalpanama" 是回文串。
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>"race a car"
+<strong>输入：</strong>s = "race a car"
 <strong>输出：</strong>false
 <strong>解释：</strong>"raceacar" 不是回文串。
 </pre>

solution/0100-0199/0137.Single Number II/README.md

@@ -6,9 +6,11 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给你一个整数数组 <code>nums</code> ，除某个元素仅出现 <strong>一次</strong> 外，其余每个元素都恰出现 <strong>三次 。</strong>请你找出并返回那个只出现了一次的元素。</p>
+<p>给你一个整数数组&nbsp;<code>nums</code> ，除某个元素仅出现 <strong>一次</strong> 外，其余每个元素都恰出现 <strong>三次 。</strong>请你找出并返回那个只出现了一次的元素。</p>
 
-<p> </p>
+<p>你必须设计并实现线性时间复杂度的算法且不使用额外空间来解决此问题。</p>
+
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -24,20 +26,16 @@
 <strong>输出：</strong>99
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= nums.length <= 3 * 10<sup>4</sup></code></li>
-	<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
+	<li><code>1 &lt;= nums.length &lt;= 3 * 10<sup>4</sup></code></li>
+	<li><code>-2<sup>31</sup> &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
 	<li><code>nums</code> 中，除某个元素仅出现 <strong>一次</strong> 外，其余每个元素都恰出现 <strong>三次</strong></li>
 </ul>
 
-<p> </p>
-
-<p><strong>进阶：</strong>你的算法应该具有线性时间复杂度。 你可以不使用额外空间来实现吗？</p>
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->

solution/0200-0299/0260.Single Number III/README.md

@@ -6,13 +6,11 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一个整数数组 <code>nums</code>，其中恰好有两个元素只出现一次，其余所有元素均出现两次。 找出只出现一次的那两个元素。你可以按 <strong>任意顺序</strong> 返回答案。</p>
+<p>给你一个整数数组&nbsp;<code>nums</code>，其中恰好有两个元素只出现一次，其余所有元素均出现两次。 找出只出现一次的那两个元素。你可以按 <strong>任意顺序</strong> 返回答案。</p>
 
-<p> </p>
+<p>你必须设计并实现线性时间复杂度的算法且仅使用常量额外空间来解决此问题。</p>
 
-<p><strong>进阶：</strong>你的算法应该具有线性时间复杂度。你能否仅使用常数空间复杂度来实现？</p>
-
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -36,11 +34,13 @@
 <strong>输出：</strong>[1,0]
 </pre>
 
+<p>&nbsp;</p>
+
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>2 <= nums.length <= 3 * 10<sup>4</sup></code></li>
-	<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
+	<li><code>2 &lt;= nums.length &lt;= 3 * 10<sup>4</sup></code></li>
+	<li><code>-2<sup>31</sup> &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
 	<li>除两个只出现一次的整数外，<code>nums</code> 中的其他数字都出现两次</li>
 </ul>
 

solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README_EN.md

@@ -4,21 +4,23 @@
 
 ## Description
 
-<p>Given the <code>root</code> of a binary tree, return <em>the length of the longest consecutive sequence path</em>.</p>
+<p>Given the <code>root</code> of a binary tree, return <em>the length of the longest <strong>consecutive sequence path</strong></em>.</p>
 
-<p>The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path needs to be from parent to child (cannot be the reverse).</p>
+<p>A <strong>consecutive sequence path</strong> is a path where the values <strong>increase by one</strong> along the path.</p>
+
+<p>Note that the path can start <strong>at any node</strong> in the tree, and you cannot go from a node to its parent in the path.</p>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/images/consec1-1-tree.jpg" style="width: 322px; height: 421px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/images/consec1-1-tree.jpg" style="width: 306px; height: 400px;" />
 <pre>
 <strong>Input:</strong> root = [1,null,3,2,4,null,null,null,5]
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> Longest consecutive sequence path is 3-4-5, so return 3.
 </pre>
 
 <p><strong>Example 2:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/images/consec1-2-tree.jpg" style="width: 262px; height: 421px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/images/consec1-2-tree.jpg" style="width: 249px; height: 400px;" />
 <pre>
 <strong>Input:</strong> root = [2,null,3,2,null,1]
 <strong>Output:</strong> 2

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README_EN.md

@@ -30,7 +30,7 @@
 <ul>
 	<li><code>m == matrix.length</code></li>
 	<li><code>n == matrix[i].length</code></li>
-	<li><code>1 &lt;= m, n &lt;= 100</code></li>
+	<li><code>1 &lt;= m, n &lt;= 200</code></li>
 	<li><code>-100 &lt;= matrix[i][j] &lt;= 100</code></li>
 	<li><code>-10<sup>5</sup> &lt;= k &lt;= 10<sup>5</sup></code></li>
 </ul>

solution/0700-0799/0749.Contain Virus/README.md

@@ -25,14 +25,14 @@
 <strong>输出:</strong> 10
 <strong>解释:</strong>一共有两块被病毒感染的区域。
 在第一天，添加 5 墙隔离病毒区域的左侧。病毒传播后的状态是:
-<img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/virus12edited-grid.jpg" />
+<img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/virus12edited-grid.jpg" style="height: 261px; width: 500px;" />
 第二天，在右侧添加 5 个墙来隔离病毒区域。此时病毒已经被完全控制住了。
 <img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/virus13edited-grid.jpg" style="height: 261px; width: 500px;" />
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
-<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/virus2-grid.jpg" style="height: 253px; width: https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/653px;" /></p>
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0700-0799/0749.Contain%20Virus/images/virus2-grid.jpg" style="height: 253px; width: 653px;" /></p>
 
 <pre>
 <strong>输入:</strong> isInfected = [[1,1,1],[1,0,1],[1,1,1]]

solution/0700-0799/0757.Set Intersection Size At Least Two/README_EN.md

@@ -4,27 +4,42 @@
 
 ## Description
 
-<p>An integer interval <code>[a, b]</code> (for integers <code>a &lt; b</code>) is a set of all consecutive integers from <code>a</code> to <code>b</code>, including <code>a</code> and <code>b</code>.</p>
+<p>You are given a 2D integer array <code>intervals</code> where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> represents all the integers from <code>start<sub>i</sub></code> to <code>end<sub>i</sub></code> inclusively.</p>
 
-<p>Find the minimum size of a set S such that for every integer interval A in <code>intervals</code>, the intersection of S with A has a size of at least two.</p>
+<p>A <strong>containing set</strong> is an array <code>nums</code> where each interval from <code>intervals</code> has <strong>at least two</strong> integers in <code>nums</code>.</p>
+
+<ul>
+	<li>For example, if <code>intervals = [[1,3], [3,7], [8,9]]</code>, then <code>[1,2,4,7,8,9]</code> and <code>[2,3,4,8,9]</code> are <strong>containing sets</strong>.</li>
+</ul>
+
+<p>Return <em>the minimum possible size of a containing set</em>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> intervals = [[1,3],[3,7],[8,9]]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> let nums = [2, 3, 4, 8, 9].
+It can be shown that there cannot be any containing array of size 4.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> intervals = [[1,3],[1,4],[2,5],[3,5]]
 <strong>Output:</strong> 3
-<strong>Explanation:</strong> Consider the set S = {2, 3, 4}.  For each interval, there are at least 2 elements from S in the interval.
-Also, there isn&#39;t a smaller size set that fulfills the above condition.
-Thus, we output the size of this set, which is 3.
+<strong>Explanation:</strong> let nums = [2, 3, 4].
+It can be shown that there cannot be any containing array of size 2.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> intervals = [[1,2],[2,3],[2,4],[4,5]]
 <strong>Output:</strong> 5
-<strong>Explanation:</strong> An example of a minimum sized set is {1, 2, 3, 4, 5}.
+<strong>Explanation:</strong> let nums = [1, 2, 3, 4, 5].
+It can be shown that there cannot be any containing array of size 4.
 </pre>
 
 <p>&nbsp;</p>
@@ -33,7 +48,7 @@ Thus, we output the size of this set, which is 3.
 <ul>
 	<li><code>1 &lt;= intervals.length &lt;= 3000</code></li>
 	<li><code>intervals[i].length == 2</code></li>
-	<li><code>0 &lt;= a<sub>i</sub> &lt;&nbsp;b<sub>i</sub> &lt;= 10<sup>8</sup></code></li>
+	<li><code>0 &lt;= start<sub>i</sub> &lt; end<sub>i</sub> &lt;= 10<sup>8</sup></code></li>
 </ul>
 
 ## Solutions

solution/0800-0899/0830.Positions of Large Groups/README.md

@@ -48,6 +48,8 @@
 <strong>输出：</strong>[]
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0900-0999/0934.Shortest Bridge/README.md

@@ -6,41 +6,50 @@
 
 <!-- 这里写题目描述 -->
 
-<p>在给定的二维二进制数组 <code>A</code> 中，存在两座岛。（岛是由四面相连的 <code>1</code> 形成的一个最大组。）</p>
+<p>给你一个大小为 <code>n x n</code> 的二元矩阵 <code>grid</code> ，其中 <code>1</code> 表示陆地，<code>0</code> 表示水域。</p>
 
-<p>现在，我们可以将 <code>0</code> 变为 <code>1</code>，以使两座岛连接起来，变成一座岛。</p>
+<p><strong>岛</strong> 是由四面相连的 <code>1</code> 形成的一个最大组，即不会与非组内的任何其他 <code>1</code> 相连。<code>grid</code> 中 <strong>恰好存在两座岛</strong> 。</p>
 
-<p>返回必须翻转的 <code>0</code> 的最小数目。（可以保证答案至少是 <code>1</code> 。）</p>
+<div class="original__bRMd">
+<div>
+<p>你可以将任意数量的 <code>0</code> 变为 <code>1</code> ，以使两座岛连接起来，变成 <strong>一座岛</strong> 。</p>
 
-<p> </p>
+<p>返回必须翻转的 <code>0</code> 的最小数目。</p>
+</div>
+</div>
+
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [[0,1],[1,0]]
+<strong>输入：</strong>grid = [[0,1],[1,0]]
 <strong>输出：</strong>1
 </pre>
 
 <p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [[0,1,0],[0,0,0],[0,0,1]]
+<strong>输入：</strong>grid = [[0,1,0],[0,0,0],[0,0,1]]
 <strong>输出：</strong>2
 </pre>
 
 <p><strong>示例 3：</strong></p>
 
 <pre>
-<strong>输入：</strong>A = [[1,1,1,1,1],[1,0,0,0,1],[1,0,1,0,1],[1,0,0,0,1],[1,1,1,1,1]]
-<strong>输出：</strong>1</pre>
+<strong>输入：</strong>grid = [[1,1,1,1,1],[1,0,0,0,1],[1,0,1,0,1],[1,0,0,0,1],[1,1,1,1,1]]
+<strong>输出：</strong>1
+</pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>2 <= A.length == A[0].length <= 100</code></li>
-	<li><code>A[i][j] == 0</code> 或 <code>A[i][j] == 1</code></li>
+	<li><code>n == grid.length == grid[i].length</code></li>
+	<li><code>2 &lt;= n &lt;= 100</code></li>
+	<li><code>grid[i][j]</code> 为 <code>0</code> 或 <code>1</code></li>
+	<li><code>grid</code> 中恰有两个岛</li>
 </ul>
 
 ## 解法

solution/0900-0999/0983.Minimum Cost For Tickets/README.md

@@ -89,7 +89,7 @@ class Solution:
                 j = bisect_left(days, days[i] + d)
                 res = min(res, c + dfs(j))
             return res
-        
+
         return dfs(0)
 ```
 

solution/0900-0999/0983.Minimum Cost For Tickets/README_EN.md

@@ -75,7 +75,7 @@ class Solution:
                 j = bisect_left(days, days[i] + d)
                 res = min(res, c + dfs(j))
             return res
-        
+
         return dfs(0)
 ```
 

solution/1000-1099/1032.Stream of Characters/README_EN.md

@@ -146,7 +146,7 @@ class StreamChecker {
             trie.insert(w);
         }
     }
-    
+
     public boolean query(char letter) {
         sb.append(letter);
         return trie.query(sb);
@@ -204,7 +204,7 @@ public:
             trie->insert(w);
         }
     }
-    
+
     bool query(char letter) {
         s += letter;
         return trie->search(s);

solution/2300-2399/2394.Employees With Deductions/README.md

@@ -95,7 +95,6 @@ Employee 3:
  - Employee 3 did not work their hours and will be deducted.
 </pre>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->

solution/2300-2399/2394.Employees With Deductions/README_EN.md

@@ -93,7 +93,6 @@ Employee 3:
  - Employee 3 did not work their hours and will be deducted.
 </pre>
 
-
 ## Solutions
 
 <!-- tabs:start -->