feat: update lc problems (#3125)

Author: yanglbme

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

@@ -28,6 +28,8 @@ tags:
 	<li><strong>围绕：</strong>如果您可以用&nbsp;<code>'X'</code>&nbsp;单元格 <strong>连接这个区域</strong>，并且区域中没有任何单元格位于&nbsp;<code>board</code> 边缘，则该区域被 <code>'X'</code>&nbsp;单元格围绕。</li>
 </ul>
 
+<p>通过将输入矩阵&nbsp;<code>board</code> 中的所有 <code>'O'</code>&nbsp;替换为 <code>'X'</code> 来 <strong>捕获被围绕的区域</strong>。</p>
+
 <div class="original__bRMd">
 <div>
 <p>&nbsp;</p>

solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md

@@ -26,16 +26,47 @@ tags:
 
 <p>&nbsp;</p>
 
-<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/images/narytreebinarytreeexample.png" style="width: 500px;"></p>
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/images/narytreebinarytreeexample.png" style="width: 500px;" /></p>
 
 <p>&nbsp;</p>
 
+<pre>
+<strong>输入：</strong>root = [1,null,3,2,4,null,5,6]
+</pre>
+
 <p>注意，上面的方法仅仅是一个例子，可能可行也可能不可行。你没有必要遵循这种形式转化，你可以自己创造和实现不同的方法。</p>
 
-<p><strong>注意：</strong></p>
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>root = [1,null,3,2,4,null,5,6]
+<strong>输出：</strong>[1,null,3,2,4,null,5,6]
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>root = [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]
+<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><strong class="example">示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>root = []
+<strong>输出：</strong>[]
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
 
 <ol>
-	<li><code>N</code>&nbsp;的范围在 <code>[1, 1000]</code></li>
+	<li><code>N</code>&nbsp;的范围在 <code>[1, 10<sup>4</sup>]</code></li>
+	<li><code>0 &lt;= Node.val &lt;= 10<sup>4</sup></code></li>
+	<li>N 叉树的高度小于等于&nbsp;<code>1000</code>。</li>
 	<li>不要使用类成员 / 全局变量 / 静态变量来存储状态。你的编码和解码算法应是无状态的。</li>
 </ol>
 

solution/0400-0499/0469.Convex Polygon/README.md

@@ -4,6 +4,7 @@ difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0469.Convex%20Polygon/README.md
 tags:
     - 几何
+    - 数组
     - 数学
 ---
 

solution/0400-0499/0469.Convex Polygon/README_EN.md

@@ -4,6 +4,7 @@ difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0469.Convex%20Polygon/README_EN.md
 tags:
     - Geometry
+    - Array
     - Math
 ---
 

solution/0500-0599/0536.Construct Binary Tree from String/README.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md
 tags:
+    - 栈
     - 树
     - 深度优先搜索
     - 字符串

solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md
 tags:
+    - Stack
     - Tree
     - Depth-First Search
     - String

solution/0500-0599/0558.Logical OR of Two Binary Grids Represented as Quad-Trees/README.md

@@ -35,11 +35,11 @@ tags:
 <pre>
 class Node {
     public boolean val;
-    public boolean isLeaf;
-    public Node topLeft;
-    public Node topRight;
-    public Node bottomLeft;
-    public Node bottomRight;
+&nbsp; &nbsp; public boolean isLeaf;
+&nbsp; &nbsp; public Node topLeft;
+&nbsp; &nbsp; public Node topRight;
+&nbsp; &nbsp; public Node bottomLeft;
+&nbsp; &nbsp; public Node bottomRight;
 }</pre>
 
 <p>我们可以按以下步骤为二维区域构建四叉树：</p>
@@ -60,9 +60,9 @@ class Node {
 
 <p>它与二叉树的序列化非常相似。唯一的区别是节点以列表形式表示 <code>[isLeaf, val]</code> 。</p>
 
-<p>如果 <code>isLeaf</code> 或者 <code>val</code> 的值为 True ，则表示它在列表 <code>[isLeaf, val]</code> 中的值为 <strong>1</strong> ；如果 <code>isLeaf</code> 或者 <code>val</code> 的值为 False ，则表示值为 <strong>0 </strong>。</p>
+<p>如果 <code>isLeaf</code> 或者 <code>val</code> 的值为 True ，则表示它在列表&nbsp;<code>[isLeaf, val]</code> 中的值为 <strong>1</strong> ；如果 <code>isLeaf</code> 或者 <code>val</code> 的值为 False ，则表示值为 <strong>0 </strong>。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -88,37 +88,13 @@ class Node {
 结果矩阵大小为 1*1，值全为 0 。
 </pre>
 
-<p><strong>示例 3：</strong></p>
-
-<pre>
-<strong>输入：</strong>quadTree1 = [[0,0],[1,0],[1,0],[1,1],[1,1]]
-, quadTree2 = [[0,0],[1,1],[1,1],[1,0],[1,1]]
-<strong>输出：</strong>[[1,1]]
-</pre>
-
-<p><strong>示例 4：</strong></p>
-
-<pre>
-<strong>输入：</strong>quadTree1 = [[0,0],[1,1],[1,0],[1,1],[1,1]]
-, quadTree2 = [[0,0],[1,1],[0,1],[1,1],[1,1],null,null,null,null,[1,1],[1,0],[1,0],[1,1]]
-<strong>输出：</strong>[[0,0],[1,1],[0,1],[1,1],[1,1],null,null,null,null,[1,1],[1,0],[1,0],[1,1]]
-</pre>
-
-<p><strong>示例 5：</strong></p>
-
-<pre>
-<strong>输入：</strong>quadTree1 = [[0,1],[1,0],[0,1],[1,1],[1,0],null,null,null,null,[1,0],[1,0],[1,1],[1,1]]
-, quadTree2 = [[0,1],[0,1],[1,0],[1,1],[1,0],[1,0],[1,0],[1,1],[1,1]]
-<strong>输出：</strong>[[0,0],[0,1],[0,1],[1,1],[1,0],[1,0],[1,0],[1,1],[1,1],[1,0],[1,0],[1,1],[1,1]]
-</pre>
-
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>quadTree1</code> 和 <code>quadTree2</code> 都是符合题目要求的四叉树，每个都代表一个 <code>n * n</code> 的矩阵。</li>
-	<li><code>n == 2^x</code> ，其中 <code>0 <= x <= 9</code>.</li>
+	<li><code>n == 2<sup>x</sup></code>&nbsp;，其中 <code>0 &lt;= x &lt;= 9</code>.</li>
 </ul>
 
 <!-- description:end -->

solution/1400-1499/1490.Clone N-ary Tree/README.md

@@ -58,7 +58,7 @@ class Node {
 
 <ul>
 	<li>给定的 N 叉树的深度小于或等于&nbsp;<code>1000</code>。</li>
-	<li>节点的总个数在&nbsp;<code>[0,&nbsp;10^4]</code>&nbsp;之间</li>
+	<li>节点的总个数在&nbsp;<code>[0,&nbsp;10<sup>4</sup>]</code>&nbsp;之间</li>
 </ul>
 
 <p>&nbsp;</p>

solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md

@@ -5,7 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1612.Ch
 tags:
     - 树
     - 深度优先搜索
+    - 哈希表
     - 二叉树
+    - 计数
 ---
 
 <!-- problem:start -->

solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md

@@ -5,7 +5,9 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1600-1699/1612.Ch
 tags:
     - Tree
     - Depth-First Search
+    - Hash Table
     - Binary Tree
+    - Counting
 ---
 
 <!-- problem:start -->