feat: update lc problems

Author: yanglbme

solution/0000-0099/0015.3Sum/README_EN.md

@@ -15,7 +15,7 @@
 <strong>Input:</strong> nums = [-1,0,1,2,-1,-4]
 <strong>Output:</strong> [[-1,-1,2],[-1,0,1]]
 <strong>Explanation:</strong> 
-nums[0] + nums[1] + nums[1] = (-1) + 0 + 1 = 0.
+nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.
 nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.
 nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.
 The distinct triplets are [-1,0,1] and [-1,-1,2].

solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md

@@ -37,10 +37,9 @@ The output order does not matter, returning [9,0] is fine too.
 
 <ul>
 	<li><code>1 &lt;= s.length &lt;= 10<sup>4</sup></code></li>
-	<li><code>s</code> consists of lower-case English letters.</li>
 	<li><code>1 &lt;= words.length &lt;= 5000</code></li>
 	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
-	<li><code>words[i]</code>&nbsp;consists of lower-case English letters.</li>
+	<li><code>s</code> and <code>words[i]</code> consist of lowercase English letters.</li>
 </ul>
 
 ## Solutions

solution/0200-0299/0215.Kth Largest Element in an Array/README.md

@@ -30,7 +30,7 @@
 <p><strong>提示： </strong></p>
 
 <ul>
-	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= k &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
 	<li><code>-10<sup>4</sup>&nbsp;&lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
 </ul>
 

solution/0200-0299/0297.Serialize and Deserialize Binary Tree/README_EN.md

@@ -8,7 +8,7 @@
 
 <p>Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.</p>
 
-<p><strong>Clarification:</strong> The input/output format is the same as <a href="/faq/#binary-tree" target="_blank">how LeetCode serializes a binary tree</a>. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.</p>
+<p><strong>Clarification:</strong> The input/output format is the same as <a href="https://support.leetcode.com/hc/en-us/articles/360011883654-What-does-1-null-2-3-mean-in-binary-tree-representation-" target="_blank">how LeetCode serializes a binary tree</a>. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.</p>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>

solution/0300-0399/0336.Palindrome Pairs/README.md

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

solution/0500-0599/0554.Brick Wall/README.md

@@ -28,6 +28,8 @@
 <strong>输出：</strong>3
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0500-0599/0592.Fraction Addition and Subtraction/Solution.py

@@ -10,7 +10,7 @@ def fractionAddition(self, expression: str) -> str:
             j = i
             while j < n and expression[j] not in '+-':
                 j += 1
-            s = expression[i: j]
+            s = expression[i:j]
             a, b = s.split('/')
             x += sign * int(a) * y // int(b)
             i = j

solution/0700-0799/0775.Global and Local Inversions/README.md

@@ -42,6 +42,8 @@
 <strong>解释：</strong>有 2 个全局倒置，和 1 个局部倒置。
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

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

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

solution/1000-1099/1030.Matrix Cells in Distance Order/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定四个整数 <code>row</code>&nbsp;,&nbsp; &nbsp;<code>cols</code> ,&nbsp; <code>rCenter</code> 和 <code>cCenter</code> 。有一个&nbsp;<code>rows x cols</code>&nbsp;的矩阵，你在单元格上的坐标是&nbsp;<code>(rCenter, cCenter)</code> 。</p>
+<p>给定四个整数 <code>rows</code>&nbsp;,&nbsp; &nbsp;<code>cols</code> ,&nbsp; <code>rCenter</code> 和 <code>cCenter</code> 。有一个&nbsp;<code>rows x cols</code>&nbsp;的矩阵，你在单元格上的坐标是&nbsp;<code>(rCenter, cCenter)</code> 。</p>
 
 <p>返回矩阵中的所有单元格的坐标，并按与<em>&nbsp;</em><code>(rCenter, cCenter)</code><em>&nbsp;</em>的 <strong>距离</strong> 从最小到最大的顺序排。你可以按 <strong>任何</strong> 满足此条件的顺序返回答案。</p>