feat: update lc problems (#4698)

Author: yanglbme

.gitignore

@@ -6,10 +6,9 @@
 *.iml
 __pycache__
 /node_modules
-/solution/result.json
 /solution/__pycache__
 /solution/.env
 .cache
 !.cache/plugin/
 !.cache/plugin/git-committers/
-!.cache/plugin/git-committers/page-authors.json
+!.cache/plugin/git-committers/page-authors.json

solution/0000-0099/0045.Jump Game II/README.md

@@ -18,7 +18,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给定一个长度为 <code>n</code> 的 <strong>0 索引</strong>整数数组 <code>nums</code>。初始位置为 <code>nums[0]</code>。</p>
+<p>给定一个长度为 <code>n</code> 的 <strong>0 索引</strong>整数数组 <code>nums</code>。初始位置在下标 0。</p>
 
 <p>每个元素 <code>nums[i]</code> 表示从索引 <code>i</code> 向后跳转的最大长度。换句话说，如果你在索引&nbsp;<code>i</code>&nbsp;处，你可以跳转到任意 <code>(i + j)</code> 处：</p>
 

solution/0000-0099/0056.Merge Intervals/README.md

@@ -36,6 +36,14 @@ tags:
 <strong>输出：</strong>[[1,5]]
 <strong>解释：</strong>区间 [1,4] 和 [4,5] 可被视为重叠区间。</pre>
 
+<p><strong class="example">示例 3：</strong></p>
+
+<pre>
+<b>输入：</b>intervals = [[4,7],[1,4]]
+<b>输出：</b>[[1,7]]
+<b>解释：</b>区间 [1,4] 和 [4,7] 可被视为重叠区间。
+</pre>
+
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>

solution/0000-0099/0056.Merge Intervals/README_EN.md

@@ -36,6 +36,14 @@ tags:
 <strong>Explanation:</strong> Intervals [1,4] and [4,5] are considered overlapping.
 </pre>
 
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> intervals = [[4,7],[1,4]]
+<strong>Output:</strong> [[1,7]]
+<strong>Explanation:</strong> Intervals [1,4] and [4,7] are considered overlapping.
+</pre>
+
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 

solution/0100-0199/0130.Surrounded Regions/README.md

@@ -37,9 +37,9 @@ tags:
 <p><strong class="example">示例 1：</strong></p>
 
 <div class="example-block">
-<p><strong>输入：</strong><span class="example-io">board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]</span></p>
+<p><strong>输入：</strong><span class="example-io">board = [['X','X','X','X'],['X','O','O','X'],['X','X','O','X'],['X','O','X','X']]</span></p>
 
-<p><b>输出：</b><span class="example-io">[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]</span></p>
+<p><b>输出：</b><span class="example-io">[['X','X','X','X'],['X','X','X','X'],['X','X','X','X'],['X','O','X','X']]</span></p>
 
 <p><strong>解释：</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0130.Surrounded%20Regions/images/1718167191-XNjUTG-image.png" style="width: 367px; height: 158px;" />
@@ -49,9 +49,9 @@ tags:
 <p><strong class="example">示例 2：</strong></p>
 
 <div class="example-block">
-<p><strong>输入：</strong><span class="example-io">board = [["X"]]</span></p>
+<p><strong>输入：</strong><span class="example-io">board = [['X']]</span></p>
 
-<p><strong>输出：</strong><span class="example-io">[["X"]]</span></p>
+<p><strong>输出：</strong><span class="example-io">[['X']]</span></p>
 </div>
 
 <p>&nbsp;</p>

solution/0200-0299/0200.Number of Islands/README.md

@@ -20,22 +20,22 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个由 <code>'1'</code>（陆地）和 <code>'0'</code>（水）组成的的二维网格，请你计算网格中岛屿的数量。</p>
+<p>给你一个由&nbsp;<code>'1'</code>（陆地）和 <code>'0'</code>（水）组成的的二维网格，请你计算网格中岛屿的数量。</p>
 
 <p>岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。</p>
 
 <p>此外，你可以假设该网格的四条边均被水包围。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
 <pre>
 <strong>输入：</strong>grid = [
-  ["1","1","1","1","0"],
-  ["1","1","0","1","0"],
-  ["1","1","0","0","0"],
-  ["0","0","0","0","0"]
+&nbsp; ['1','1','1','1','0'],
+&nbsp; ['1','1','0','1','0'],
+&nbsp; ['1','1','0','0','0'],
+&nbsp; ['0','0','0','0','0']
 ]
 <strong>输出：</strong>1
 </pre>
@@ -44,22 +44,22 @@ tags:
 
 <pre>
 <strong>输入：</strong>grid = [
-  ["1","1","0","0","0"],
-  ["1","1","0","0","0"],
-  ["0","0","1","0","0"],
-  ["0","0","0","1","1"]
+&nbsp; ['1','1','0','0','0'],
+&nbsp; ['1','1','0','0','0'],
+&nbsp; ['0','0','1','0','0'],
+&nbsp; ['0','0','0','1','1']
 ]
 <strong>输出：</strong>3
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>m == grid.length</code></li>
 	<li><code>n == grid[i].length</code></li>
-	<li><code>1 <= m, n <= 300</code></li>
+	<li><code>1 &lt;= m, n &lt;= 300</code></li>
 	<li><code>grid[i][j]</code> 的值为 <code>'0'</code> 或 <code>'1'</code></li>
 </ul>
 

solution/0200-0299/0223.Rectangle Area/README.md

@@ -49,7 +49,10 @@ tags:
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>-10<sup>4</sup> &lt;= ax1, ay1, ax2, ay2, bx1, by1, bx2, by2 &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= ax1 &lt;= ax2 &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= ay1 &lt;= ay2 &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= bx1 &lt;= bx2 &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>4</sup> &lt;= by1 &lt;= by2 &lt;= 10<sup>4</sup></code></li>
 </ul>
 
 <!-- description:end -->

solution/0300-0399/0334.Increasing Triplet Subsequence/README.md

@@ -43,7 +43,7 @@ tags:
 <pre>
 <strong>输入：</strong>nums = [2,1,5,0,4,6]
 <strong>输出：</strong>true
-<strong>解释：</strong>三元组 (3, 4, 5) 满足题意，因为 nums[3] == 0 &lt; nums[4] == 4 &lt; nums[5] == 6
+<strong>解释：</strong>其中一个满足题意的三元组是 (3, 4, 5)，因为 nums[3] == 0 &lt; nums[4] == 4 &lt; nums[5] == 6
 </pre>
 
 <p>&nbsp;</p>

solution/0300-0399/0334.Increasing Triplet Subsequence/README_EN.md

@@ -41,7 +41,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [2,1,5,0,4,6]
 <strong>Output:</strong> true
-<strong>Explanation:</strong> The triplet (3, 4, 5) is valid because nums[3] == 0 &lt; nums[4] == 4 &lt; nums[5] == 6.
+<strong>Explanation:</strong> One of the valid triplet is (3, 4, 5), because nums[3] == 0 &lt; nums[4] == 4 &lt; nums[5] == 6.
 </pre>
 
 <p>&nbsp;</p>

solution/0300-0399/0347.Top K Frequent Elements/README.md

@@ -25,34 +25,45 @@ tags:
 
 <p>给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> ，请你返回其中出现频率前 <code>k</code> 高的元素。你可以按 <strong>任意顺序</strong> 返回答案。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
-<p><strong>示例 1:</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
-<pre>
-<strong>输入: </strong>nums = [1,1,1,2,2,3], k = 2
-<strong>输出: </strong>[1,2]
-</pre>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>nums = [1,1,1,2,2,3], k = 2</span></p>
 
-<p><strong>示例 2:</strong></p>
+<p><strong>输出：</strong><span class="example-io">[1,2]</span></p>
+</div>
 
-<pre>
-<strong>输入: </strong>nums = [1], k = 1
-<strong>输出: </strong>[1]</pre>
+<p><strong class="example">示例 2：</strong></p>
 
-<p> </p>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>nums = [1], k = 1</span></p>
+
+<p><span class="example-io"><b>输出：</b>[1]</span></p>
+</div>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>nums = [1,2,1,2,1,2,3,1,3,2], k = 2</span></p>
+
+<p><strong>输出：</strong><span class="example-io">[1,2]</span></p>
+</div>
+
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>k</code> 的取值范围是 <code>[1, 数组中不相同的元素的个数]</code></li>
 	<li>题目数据保证答案唯一，换句话说，数组中前 <code>k</code> 个高频元素的集合是唯一的</li>
 </ul>
 
-<p> </p>
+<p>&nbsp;</p>
 
-<p><strong>进阶：</strong>你所设计算法的时间复杂度 <strong>必须</strong> 优于 <code>O(n log n)</code> ，其中 <code>n</code><em> </em>是数组大小。</p>
+<p><strong>进阶：</strong>你所设计算法的时间复杂度 <strong>必须</strong> 优于 <code>O(n log n)</code> ，其中 <code>n</code><em>&nbsp;</em>是数组大小。</p>
 
 <!-- description:end -->