feat: update lc problems

Author: yanglbme

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

@@ -1,35 +1,30 @@
-# [28. 实现 strStr()](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
+# [28. 找出字符串中第一个匹配项的下标](https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string)
 
 [English Version](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README_EN.md)
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>实现&nbsp;<a href="https://baike.baidu.com/item/strstr/811469" target="_blank">strStr()</a>&nbsp;函数。</p>
-
-<p>给你两个字符串&nbsp;<code>haystack</code> 和 <code>needle</code> ，请你在 <code>haystack</code> 字符串中找出 <code>needle</code> 字符串出现的第一个位置（下标从 0 开始）。如果不存在，则返回&nbsp; <code>-1</code><strong> </strong>。</p>
-
-<p><strong>说明：</strong></p>
-
-<p>当&nbsp;<code>needle</code>&nbsp;是空字符串时，我们应当返回什么值呢？这是一个在面试中很好的问题。</p>
-
-<p>对于本题而言，当&nbsp;<code>needle</code>&nbsp;是空字符串时我们应当返回 0 。这与 C 语言的&nbsp;<a href="https://baike.baidu.com/item/strstr/811469" target="_blank">strstr()</a>&nbsp;以及 Java 的&nbsp;<a href="https://docs.oracle.com/javase/7/docs/api/java/lang/String.html#indexOf(java.lang.String)" target="_blank">indexOf()</a>&nbsp;定义相符。</p>
+<p>给你两个字符串&nbsp;<code>haystack</code> 和 <code>needle</code> ，请你在 <code>haystack</code> 字符串中找出 <code>needle</code> 字符串的第一个匹配项的下标（下标从 0 开始）。如果&nbsp;<code>needle</code> 不是 <code>haystack</code> 的一部分，则返回&nbsp; <code>-1</code><strong> </strong>。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
 <pre>
-<strong>输入：</strong>haystack = "hello", needle = "ll"
-<strong>输出：</strong>2
+<strong>输入：</strong>haystack = "sadbutsad", needle = "sad"
+<strong>输出：</strong>0
+<strong>解释：</strong>"sad" 在下标 0 和 6 处匹配。
+第一个匹配项的下标是 0 ，所以返回 0 。
 </pre>
 
-<p><strong>示例 2：</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>haystack = "aaaaa", needle = "bba"
+<strong>输入：</strong>haystack = "leetcode", needle = "leeto"
 <strong>输出：</strong>-1
+<strong>解释：</strong>"leeto" 没有在 "leetcode" 中出现，所以返回 -1 。
 </pre>
 
 <p>&nbsp;</p>

solution/0000-0099/0039.Combination Sum/README_EN.md

@@ -8,7 +8,7 @@
 
 <p>The <strong>same</strong> number may be chosen from <code>candidates</code> an <strong>unlimited number of times</strong>. Two combinations are unique if the frequency of at least one of the chosen numbers is different.</p>
 
-<p>It is <strong>guaranteed</strong> that the number of unique combinations that sum up to <code>target</code> is less than <code>150</code> combinations for the given input.</p>
+<p>The test cases are generated such that the number of unique combinations that sum up to <code>target</code> is less than <code>150</code> combinations for the given input.</p>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
@@ -41,7 +41,7 @@ These are the only two combinations.
 
 <ul>
 	<li><code>1 &lt;= candidates.length &lt;= 30</code></li>
-	<li><code>1 &lt;= candidates[i] &lt;= 200</code></li>
+	<li><code>2 &lt;= candidates[i] &lt;= 40</code></li>
 	<li>All elements of <code>candidates</code> are <strong>distinct</strong>.</li>
 	<li><code>1 &lt;= target &lt;= 500</code></li>
 </ul>

solution/0000-0099/0067.Add Binary/README.md

@@ -6,30 +6,30 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给你两个二进制字符串，返回它们的和（用二进制表示）。</p>
-
-<p>输入为 <strong>非空 </strong>字符串且只包含数字&nbsp;<code>1</code>&nbsp;和&nbsp;<code>0</code>。</p>
+<p>给你两个二进制字符串 <code>a</code> 和 <code>b</code> ，以二进制字符串的形式返回它们的和。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例&nbsp;1:</strong></p>
+<p><strong>示例&nbsp;1：</strong></p>
 
-<pre><strong>输入:</strong> a = &quot;11&quot;, b = &quot;1&quot;
-<strong>输出:</strong> &quot;100&quot;</pre>
+<pre>
+<strong>输入:</strong>a = "11", b = "1"
+<strong>输出：</strong>"100"</pre>
 
-<p><strong>示例&nbsp;2:</strong></p>
+<p><strong>示例&nbsp;2：</strong></p>
 
-<pre><strong>输入:</strong> a = &quot;1010&quot;, b = &quot;1011&quot;
-<strong>输出:</strong> &quot;10101&quot;</pre>
+<pre>
+<strong>输入：</strong>a = "1010", b = "1011"
+<strong>输出：</strong>"10101"</pre>
 
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li>每个字符串仅由字符 <code>&#39;0&#39;</code> 或 <code>&#39;1&#39;</code> 组成。</li>
-	<li><code>1 &lt;= a.length, b.length &lt;= 10^4</code></li>
-	<li>字符串如果不是 <code>&quot;0&quot;</code> ，就都不含前导零。</li>
+	<li><code>1 &lt;= a.length, b.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>a</code> 和 <code>b</code> 仅由字符 <code>'0'</code> 或 <code>'1'</code> 组成</li>
+	<li>字符串如果不是 <code>"0"</code> ，就不含前导零</li>
 </ul>
 
 ## 解法

solution/0100-0199/0188.Best Time to Buy and Sell Stock IV/README_EN.md

@@ -31,8 +31,8 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>0 &lt;= k &lt;= 100</code></li>
-	<li><code>0 &lt;= prices.length &lt;= 1000</code></li>
+	<li><code>1 &lt;= k &lt;= 100</code></li>
+	<li><code>1 &lt;= prices.length &lt;= 1000</code></li>
 	<li><code>0 &lt;= prices[i] &lt;= 1000</code></li>
 </ul>
 

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/0400-0499/0457.Circular Array Loop/README_EN.md

@@ -24,34 +24,32 @@
 <p>Return <code>true</code><em> if there is a <strong>cycle</strong> in </em><code>nums</code><em>, or </em><code>false</code><em> otherwise</em>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
-
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0457.Circular%20Array%20Loop/images/img1.jpg" style="width: 402px; height: 289px;" />
 <pre>
 <strong>Input:</strong> nums = [2,-1,1,2,2]
 <strong>Output:</strong> true
-<strong>Explanation:</strong>
-There is a cycle from index 0 -&gt; 2 -&gt; 3 -&gt; 0 -&gt; ...
-The cycle&#39;s length is 3.
+<strong>Explanation:</strong> The graph shows how the indices are connected. White nodes are jumping forward, while red is jumping backward.
+We can see the cycle 0 --&gt; 2 --&gt; 3 --&gt; 0 --&gt; ..., and all of its nodes are white (jumping in the same direction).
 </pre>
 
-<p><strong>Example 2:</strong></p>
-
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0457.Circular%20Array%20Loop/images/img2.jpg" style="width: 402px; height: 390px;" />
 <pre>
-<strong>Input:</strong> nums = [-1,2]
+<strong>Input:</strong> nums = [-1,-2,-3,-4,-5,6]
 <strong>Output:</strong> false
-<strong>Explanation:</strong>
-The sequence from index 1 -&gt; 1 -&gt; 1 -&gt; ... is not a cycle because the sequence&#39;s length is 1.
-By definition the sequence&#39;s length must be strictly greater than 1 to be a cycle.
+<strong>Explanation:</strong> The graph shows how the indices are connected. White nodes are jumping forward, while red is jumping backward.
+The only cycle is of size 1, so we return false.
 </pre>
 
-<p><strong>Example 3:</strong></p>
-
+<p><strong class="example">Example 3:</strong></p>
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0457.Circular%20Array%20Loop/images/img3.jpg" style="width: 497px; height: 242px;" />
 <pre>
-<strong>Input:</strong> nums = [-2,1,-1,-2,-2]
-<strong>Output:</strong> false
-<strong>Explanation:</strong>
-The sequence from index 1 -&gt; 2 -&gt; 1 -&gt; ... is not a cycle because nums[1] is positive, but nums[2] is negative.
-Every nums[seq[j]] must be either all positive or all negative.
+<strong>Input:</strong> nums = [1,-1,5,1,4]
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The graph shows how the indices are connected. White nodes are jumping forward, while red is jumping backward.
+We can see the cycle 0 --&gt; 1 --&gt; 0 --&gt; ..., and while it is of size &gt; 1, it has a node jumping forward and a node jumping backward, so <strong>it is not a cycle</strong>.
+We can see the cycle 3 --&gt; 4 --&gt; 3 --&gt; ..., and all of its nodes are white (jumping in the same direction).
 </pre>
 
 <p>&nbsp;</p>

solution/0400-0499/0457.Circular Array Loop/images/img1.jpg

@@ -1,5 +1,7 @@
 class Solution:
-    def findMaximizedCapital(self, k: int, w: int, profits: List[int], capital: List[int]) -> int:
+    def findMaximizedCapital(
+        self, k: int, w: int, profits: List[int], capital: List[int]
+    ) -> int:
         h1 = [(c, p) for c, p in zip(capital, profits)]
         heapify(h1)
         h2 = []

solution/0400-0499/0457.Circular Array Loop/images/img2.jpg

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

solution/0500-0599/0502.IPO/Solution.py

@@ -6,11 +6,11 @@
 
 <!-- 这里写题目描述 -->
 
-<p>给定一棵二叉树 <code>root</code>，返回所有<strong>重复的子树</strong>。</p>
+<p>给你一棵二叉树的根节点 <code>root</code> ，返回所有 <strong>重复的子树 </strong>。</p>
 
-<p>对于同一类的重复子树，你只需要返回其中任意<strong>一棵</strong>的根结点即可。</p>
+<p>对于同一类的重复子树，你只需要返回其中任意 <strong>一棵 </strong>的根结点即可。</p>
 
-<p>如果两棵树具有<strong>相同的结构</strong>和<strong>相同的结点值</strong>，则它们是<strong>重复</strong>的。</p>
+<p>如果两棵树具有<strong> 相同的结构</strong> 和 <strong>相同的结点值 </strong>，则认为二者是 <strong>重复 </strong>的。</p>
 
 <p>&nbsp;</p>
 
@@ -43,7 +43,7 @@
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li>树中的结点数在<code>[1,10^4]</code>范围内。</li>
+	<li>树中的结点数在 <code>[1, 5000]</code> 范围内。</li>
 	<li><code>-200 &lt;= Node.val &lt;= 200</code></li>
 </ul>
 

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

@@ -6,39 +6,64 @@
 
 <!-- 这里写题目描述 -->
 
-<p>现有一个房间，墙上挂有&nbsp;<code>n</code>&nbsp;只已经打开的灯泡和 4 个按钮。在进行了&nbsp;<code>m</code>&nbsp;次未知操作后，你需要返回这&nbsp;<code>n</code>&nbsp;只灯泡可能有多少种不同的状态。</p>
+<p>房间中有 <code>n</code>&nbsp;只已经打开的灯泡，编号从 <code>1</code> 到 <code>n</code> 。墙上挂着 <strong>4 个开关</strong> 。</p>
 
-<p>假设这 <code>n</code> 只灯泡被编号为 [1, 2, 3 ..., n]，这 4 个按钮的功能如下：</p>
+<p>这 4 个开关各自都具有不同的功能，其中：</p>
 
-<ol>
-	<li>将所有灯泡的状态反转（即开变为关，关变为开）</li>
-	<li>将编号为偶数的灯泡的状态反转</li>
-	<li>将编号为奇数的灯泡的状态反转</li>
-	<li>将编号为 <code>3k+1</code> 的灯泡的状态反转（k = 0, 1, 2, ...)</li>
-</ol>
+<ul>
+	<li><strong>开关 1 ：</strong>反转当前所有灯的状态（即开变为关，关变为开）</li>
+	<li><strong>开关 2 ：</strong>反转编号为偶数的灯的状态（即 <code>2, 4, ...</code>）</li>
+	<li><strong>开关 3 ：</strong>反转编号为奇数的灯的状态（即 <code>1, 3, ...</code>）</li>
+	<li><strong>开关 4 ：</strong>反转编号为 <code>j = 3k + 1</code> 的灯的状态，其中 <code>k = 0, 1, 2, ...</code>（即 <code>1, 4, 7, 10, ...</code>）</li>
+</ul>
 
-<p><strong>示例 1:</strong></p>
+<p>你必须 <strong>恰好</strong> 按压开关 <code>presses</code> 次。每次按压，你都需要从 4 个开关中选出一个来执行按压操作。</p>
 
-<pre><strong>输入:</strong> n = 1, m = 1.
-<strong>输出:</strong> 2
-<strong>说明:</strong> 状态为: [开], [关]
+<p>给你两个整数 <code>n</code> 和 <code>presses</code> ，执行完所有按压之后，返回 <strong>不同可能状态</strong> 的数量。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>n = 1, presses = 1
+<strong>输出：</strong>2
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关]
+- 按压开关 2 ，[开]
 </pre>
 
-<p><strong>示例 2:</strong></p>
+<p><strong>示例 2：</strong></p>
 
-<pre><strong>输入:</strong> n = 2, m = 1.
-<strong>输出:</strong> 3
-<strong>说明:</strong> 状态为: [开, 关], [关, 开], [关, 关]
+<pre>
+<strong>输入：</strong>n = 2, presses = 1
+<strong>输出：</strong>3
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关, 关]
+- 按压开关 2 ，[开, 关]
+- 按压开关 3 ，[关, 开]
 </pre>
 
-<p><strong>示例 3:</strong></p>
+<p><strong>示例 3：</strong></p>
 
-<pre><strong>输入:</strong> n = 3, m = 1.
-<strong>输出:</strong> 4
-<strong>说明:</strong> 状态为: [关, 开, 关], [开, 关, 开], [关, 关, 关], [关, 开, 开].
+<pre>
+<strong>输入：</strong>n = 3, presses = 1
+<strong>输出：</strong>4
+<strong>解释：</strong>状态可以是：
+- 按压开关 1 ，[关, 关, 关]
+- 按压开关 2 ，[关, 开, 关]
+- 按压开关 3 ，[开, 关, 开]
+- 按压开关 4 ，[关, 开, 开]
 </pre>
 
-<p><strong>注意：</strong>&nbsp;<code>n</code>&nbsp;和&nbsp;<code>m</code> 都属于 [0, 1000].</p>
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 1000</code></li>
+	<li><code>0 &lt;= presses &lt;= 1000</code></li>
+</ul>
 
 ## 解法
 

solution/0600-0699/0652.Find Duplicate Subtrees/README.md

@@ -14,40 +14,31 @@
 
 <p><strong>示例 1：</strong></p>
 
-<pre>11000
-11000
-00011
-00011
-</pre>
-
-<p>给定上图，返回结果 <code>1</code> 。</p>
-
-<p><strong>示例 2：</strong></p>
-
-<pre>11011
-10000
-00001
-11011</pre>
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/images/distinctisland1-1-grid.jpg" /></p>
 
-<p>给定上图，返回结果 <code>3</code> 。<br>
-<br>
-<strong>注意：</strong></p>
-
-<pre>11
-1
+<pre>
+<strong>输入:</strong> grid = [[1,1,0,0,0],[1,1,0,0,0],[0,0,0,1,1],[0,0,0,1,1]]
+<b>输出：</b>1
 </pre>
 
-<p>和</p>
+<p><strong>示例 2：</strong></p>
 
-<pre> 1
-11
-</pre>
+<pre>
+<strong>输入:</strong> grid = [[1,1,0,1,1],[1,0,0,0,0],[0,0,0,0,1],[1,1,0,1,1]]
+<b>输出</b><strong>:</strong> 3</pre>
 
-<p>是不同的岛屿，因为我们不考虑旋转、翻转操作。</p>
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/images/distinctisland1-2-grid.jpg" /></p>
 
 <p>&nbsp;</p>
 
-<p><strong>提示：</strong>二维数组每维的大小都不会超过 50 。</p>
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>m == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= m, n &lt;= 50</code></li>
+	<li><code>grid[i][j]</code>&nbsp;仅包含&nbsp;<code>0</code>&nbsp;或&nbsp;<code>1</code></li>
+</ul>
 
 ## 解法
 

solution/0600-0699/0672.Bulb Switcher II/README.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a Circular Linked List node, which is sorted in ascending order, write a function to insert a value <code>insertVal</code> into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list and may not necessarily be the smallest value in the circular list.</p>
+<p>Given a Circular Linked List node, which is sorted in non-descending order, write a function to insert a value <code>insertVal</code> into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list and may not necessarily be the smallest value in the circular list.</p>
 
 <p>If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the circular list should remain sorted.</p>
 

solution/0600-0699/0694.Number of Distinct Islands/README.md

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

solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md

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