feat: update lc problems (doocs#2625)

Author: yanglbme

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

@@ -8,46 +8,54 @@
 
 <p>You are given a string <code>s</code> and an array of strings <code>words</code>. All the strings of <code>words</code> are of <strong>the same length</strong>.</p>
 
-<p>A <strong>concatenated substring</strong> in <code>s</code> is a substring that contains all the strings of any permutation of <code>words</code> concatenated.</p>
+<p>A <strong>concatenated string</strong>&nbsp;is a string that exactly contains all the strings of any permutation of <code>words</code> concatenated.</p>
 
 <ul>
-	<li>For example, if <code>words = [&quot;ab&quot;,&quot;cd&quot;,&quot;ef&quot;]</code>, then <code>&quot;abcdef&quot;</code>, <code>&quot;abefcd&quot;</code>, <code>&quot;cdabef&quot;</code>, <code>&quot;cdefab&quot;</code>, <code>&quot;efabcd&quot;</code>, and <code>&quot;efcdab&quot;</code> are all concatenated strings. <code>&quot;acdbef&quot;</code> is not a concatenated substring because it is not the concatenation of any permutation of <code>words</code>.</li>
+	<li>For example, if <code>words = [&quot;ab&quot;,&quot;cd&quot;,&quot;ef&quot;]</code>, then <code>&quot;abcdef&quot;</code>, <code>&quot;abefcd&quot;</code>, <code>&quot;cdabef&quot;</code>, <code>&quot;cdefab&quot;</code>, <code>&quot;efabcd&quot;</code>, and <code>&quot;efcdab&quot;</code> are all concatenated strings. <code>&quot;acdbef&quot;</code> is not a concatenated string because it is not the concatenation of any permutation of <code>words</code>.</li>
 </ul>
 
-<p>Return <em>the starting indices of all the concatenated substrings in </em><code>s</code>. You can return the answer in <strong>any order</strong>.</p>
+<p>Return an array of&nbsp;<em>the starting indices</em> of all the concatenated substrings in<em> </em><code>s</code>. You can return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> s = &quot;barfoothefoobarman&quot;, words = [&quot;foo&quot;,&quot;bar&quot;]
-<strong>Output:</strong> [0,9]
-<strong>Explanation:</strong> Since words.length == 2 and words[i].length == 3, the concatenated substring has to be of length 6.
-The substring starting at 0 is &quot;barfoo&quot;. It is the concatenation of [&quot;bar&quot;,&quot;foo&quot;] which is a permutation of words.
-The substring starting at 9 is &quot;foobar&quot;. It is the concatenation of [&quot;foo&quot;,&quot;bar&quot;] which is a permutation of words.
-The output order does not matter. Returning [9,0] is fine too.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;barfoothefoobarman&quot;, words = [&quot;foo&quot;,&quot;bar&quot;]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[0,9]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The substring starting at 0 is <code>&quot;barfoo&quot;</code>. It is the concatenation of <code>[&quot;bar&quot;,&quot;foo&quot;]</code> which is a permutation of <code>words</code>.<br />
+The substring starting at 9 is <code>&quot;foobar&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;]</code> which is a permutation of <code>words</code>.<br />
+The output order does not matter. Returning <code>[9,0]</code> is fine too.</p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> s = &quot;wordgoodgoodgoodbestword&quot;, words = [&quot;word&quot;,&quot;good&quot;,&quot;best&quot;,&quot;word&quot;]
-<strong>Output:</strong> []
-<strong>Explanation:</strong> Since words.length == 4 and words[i].length == 4, the concatenated substring has to be of length 16.
-There is no substring of length 16 in s that is equal to the concatenation of any permutation of words.
-We return an empty array.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;wordgoodgoodgoodbestword&quot;, words = [&quot;word&quot;,&quot;good&quot;,&quot;best&quot;,&quot;word&quot;]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>There is no concatenated substring.</p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> s = &quot;barfoofoobarthefoobarman&quot;, words = [&quot;bar&quot;,&quot;foo&quot;,&quot;the&quot;]
-<strong>Output:</strong> [6,9,12]
-<strong>Explanation:</strong> Since words.length == 3 and words[i].length == 3, the concatenated substring has to be of length 9.
-The substring starting at 6 is &quot;foobarthe&quot;. It is the concatenation of [&quot;foo&quot;,&quot;bar&quot;,&quot;the&quot;] which is a permutation of words.
-The substring starting at 9 is &quot;barthefoo&quot;. It is the concatenation of [&quot;bar&quot;,&quot;the&quot;,&quot;foo&quot;] which is a permutation of words.
-The substring starting at 12 is &quot;thefoobar&quot;. It is the concatenation of [&quot;the&quot;,&quot;foo&quot;,&quot;bar&quot;] which is a permutation of words.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;barfoofoobarthefoobarman&quot;, words = [&quot;bar&quot;,&quot;foo&quot;,&quot;the&quot;]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[6,9,12]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The substring starting at 6 is <code>&quot;foobarthe&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;,&quot;the&quot;]</code>.<br />
+The substring starting at 9 is <code>&quot;barthefoo&quot;</code>. It is the concatenation of <code>[&quot;bar&quot;,&quot;the&quot;,&quot;foo&quot;]</code>.<br />
+The substring starting at 12 is <code>&quot;thefoobar&quot;</code>. It is the concatenation of <code>[&quot;the&quot;,&quot;foo&quot;,&quot;bar&quot;]</code>.</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

solution/0100-0199/0133.Clone Graph/README.md

@@ -12,7 +12,8 @@
 
 <p>图中的每个节点都包含它的值 <code>val</code>（<code>int</code>） 和其邻居的列表（<code>list[Node]</code>）。</p>
 
-<pre>class Node {
+<pre>
+class Node {
     public int val;
     public List&lt;Node&gt; neighbors;
 }</pre>
@@ -31,9 +32,10 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0133.Clone%20Graph/images/133_clone_graph_question.png" style="height: 500px; width: 500px;"></p>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0133.Clone%20Graph/images/133_clone_graph_question.png" style="height: 500px; width: 500px;" /></p>
 
-<pre><strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
+<pre>
+<strong>输入：</strong>adjList = [[2,4],[1,3],[2,4],[1,3]]
 <strong>输出：</strong>[[2,4],[1,3],[2,4],[1,3]]
 <strong>解释：
 </strong>图中有 4 个节点。
@@ -45,38 +47,33 @@
 
 <p><strong>示例 2：</strong></p>
 
-<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0133.Clone%20Graph/images/graph.png" style="height: 148px; width: 163px;"></p>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0133.Clone%20Graph/images/graph.png" style="height: 148px; width: 163px;" /></p>
 
-<pre><strong>输入：</strong>adjList = [[]]
+<pre>
+<strong>输入：</strong>adjList = [[]]
 <strong>输出：</strong>[[]]
 <strong>解释：</strong>输入包含一个空列表。该图仅仅只有一个值为 1 的节点，它没有任何邻居。
 </pre>
 
 <p><strong>示例 3：</strong></p>
 
-<pre><strong>输入：</strong>adjList = []
+<pre>
+<strong>输入：</strong>adjList = []
 <strong>输出：</strong>[]
 <strong>解释：</strong>这个图是空的，它不含任何节点。
 </pre>
 
-<p><strong>示例 4：</strong></p>
-
-<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0133.Clone%20Graph/images/graph-1.png" style="height: 133px; width: 272px;"></p>
-
-<pre><strong>输入：</strong>adjList = [[2],[1]]
-<strong>输出：</strong>[[2],[1]]</pre>
-
 <p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
-<ol>
-	<li>节点数不超过 100 。</li>
-	<li>每个节点值&nbsp;<code>Node.val</code> 都是唯一的，<code>1 &lt;= Node.val &lt;= 100</code>。</li>
-	<li>无向图是一个<a href="https://baike.baidu.com/item/简单图/1680528?fr=aladdin" target="_blank">简单图</a>，这意味着图中没有重复的边，也没有自环。</li>
-	<li>由于图是无向的，如果节点 <em>p</em> 是节点 <em>q</em> 的邻居，那么节点 <em>q</em> 也必须是节点 <em>p</em>&nbsp;的邻居。</li>
+<ul>
+	<li>这张图中的节点数在 <code>[0, 100]</code>&nbsp;之间。</li>
+	<li><code>1 &lt;= Node.val &lt;= 100</code></li>
+	<li>每个节点值&nbsp;<code>Node.val</code> 都是唯一的，</li>
+	<li>图中没有重复的边，也没有自环。</li>
 	<li>图是连通图，你可以从给定节点访问到所有节点。</li>
-</ol>
+</ul>
 
 ## 解法
 

solution/0400-0499/0418.Sentence Screen Fitting/README.md

@@ -10,73 +10,61 @@
 
 <p>给你一个 <code>rows x cols</code> 的屏幕和一个用 <strong>非空 </strong>的单词列表组成的句子，请你计算出给定句子可以在屏幕上完整显示的次数。</p>
 
-<p><strong>注意：</strong></p>
-
-<ol>
-	<li>一个单词不能拆分成两行。</li>
-	<li>单词在句子中的顺序必须保持不变。</li>
-	<li><strong>在一行中 </strong>的两个连续单词必须用一个空格符分隔。</li>
-	<li>句子中的单词总量不会超过 100。</li>
-	<li>每个单词的长度大于 0 且不会超过 10。</li>
-	<li>1 &le; <code>rows</code>, <code>cols</code> &le; 20,000.</li>
-</ol>
+<p>句子中的单词顺序必须保持不变，并且不能将一个单词分成两行。一行中的两个连续单词必须用空白分开。</p>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
-<pre><strong>输入：</strong>
-rows = 2, cols = 8, 句子 sentence = [&quot;hello&quot;, &quot;world&quot;]
-
-<strong>输出：</strong>
-1
-
+<pre>
+<strong>输入：</strong>sentence = ["hello", "world"], rows = 2, cols = 8
+<strong>输出：</strong>1
 <strong>解释：</strong>
 hello---
 world---
-
-<strong>字符 &#39;-&#39; 表示屏幕上的一个空白位置。</strong>
+字符 '-' 表示屏幕上的一个空白位置。
 </pre>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 2：</strong></p>
 
-<pre><strong>输入：</strong>
-rows = 3, cols = 6, 句子 sentence = [&quot;a&quot;, &quot;bcd&quot;, &quot;e&quot;]
-
-<strong>输出：</strong>
-2
-
+<pre>
+<strong>输入：</strong>sentence = ["a", "bcd", "e"], rows = 3, cols = 6
+<strong>输出：</strong>2
 <strong>解释：</strong>
 a-bcd- 
 e-a---
 bcd-e-
-
-<strong>字符 &#39;-&#39; 表示屏幕上的一个空白位置。</strong>
+字符 '-' 表示屏幕上的一个空白位置。
 </pre>
 
 <p>&nbsp;</p>
 
 <p><strong>示例 3：</strong></p>
 
-<pre><strong>输入：</strong>
-rows = 4, cols = 5, 句子 sentence = [&quot;I&quot;, &quot;had&quot;, &quot;apple&quot;, &quot;pie&quot;]
-
-<strong>输出：</strong>
-1
-
+<pre>
+<strong>输入：</strong>sentence = ["I", "had", "apple", "pie"], rows = 4, cols = 5
+<strong>输出：</strong>1
 <strong>解释：</strong>
 I-had
 apple
 pie-I
 had--
-
-<strong>字符 &#39;-&#39; 表示屏幕上的一个空白位置。</strong>
+字符 '-' 表示屏幕上的一个空白位置。
 </pre>
 
 <p>&nbsp;</p>
 
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= sentence.length &lt;= 100</code></li>
+	<li><code>1 &lt;= sentence[i].length &lt;= 10</code></li>
+	<li><code>sentence[i]</code>&nbsp;由小写英文字母组成。</li>
+	<li><code>1 &lt;= rows, cols &lt;= 2 * 10<sup>4</sup></code></li>
+</ul>
+
 ## 解法
 
 ### 方法一：贪心

solution/0800-0899/0842.Split Array into Fibonacci Sequence/README.md

@@ -29,7 +29,7 @@
 <pre>
 <strong>输入：</strong>num = "1101111"
 <strong>输出：</strong>[11,0,11,11]
-<strong>解释：</strong>输出[110,1,111]也可以。</pre>
+<strong>解释：</strong>输出 [110,1,111] 也可以。</pre>
 
 <p><strong>示例 2：</strong></p>
 

solution/1200-1299/1201.Ugly Number III/README.md

@@ -2,17 +2,17 @@
 
 [English Version](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md)
 
-<!-- tags:数学,二分查找,数论 -->
+<!-- tags:数学,二分查找,组合数学,数论 -->
 
 ## 题目描述
 
 <!-- 这里写题目描述 -->
 
-<p>给你四个整数：<code>n</code> 、<code>a</code> 、<code>b</code> 、<code>c</code> ，请你设计一个算法来找出第 <code>n</code> 个丑数。</p>
+<p>丑数是可以被&nbsp;<code>a</code>&nbsp;<strong>或</strong>&nbsp;<code>b</code>&nbsp;<strong>或</strong> <code>c</code>&nbsp;整除的 <strong>正整数</strong> 。</p>
 
-<p>丑数是可以被 <code>a</code> <strong>或</strong> <code>b</code> <strong>或</strong> <code>c</code> 整除的 <strong>正整数</strong> 。</p>
+<p>给你四个整数：<code>n</code> 、<code>a</code> 、<code>b</code> 、<code>c</code> ，请你设计一个算法来找出第&nbsp;<code>n</code>&nbsp;个丑数。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 
@@ -37,21 +37,14 @@
 <strong>解释：</strong>丑数序列为 2, 4, 6, 8, 10, 11, 12, 13... 其中第 5 个是 10。
 </pre>
 
-<p><strong>示例 4：</strong></p>
-
-<pre>
-<strong>输入：</strong>n = 1000000000, a = 2, b = 217983653, c = 336916467
-<strong>输出：</strong>1999999984
-</pre>
-
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 <= n, a, b, c <= 10^9</code></li>
-	<li><code>1 <= a * b * c <= 10^18</code></li>
-	<li>本题结果在 <code>[1, 2 * 10^9]</code> 的范围内</li>
+	<li><code>1 &lt;= n, a, b, c &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= a * b * c &lt;= 10<sup>18</sup></code></li>
+	<li>本题结果在&nbsp;<code>[1,&nbsp;2 * 10<sup>9</sup>]</code>&nbsp;的范围内</li>
 </ul>
 
 ## 解法

solution/1200-1299/1201.Ugly Number III/README_EN.md

@@ -2,7 +2,7 @@
 
 [中文文档](/solution/1200-1299/1201.Ugly%20Number%20III/README.md)
 
-<!-- tags:Math,Binary Search,Number Theory -->
+<!-- tags:Math,Binary Search,Combinatorics,Number Theory -->
 
 ## Description
 

solution/1700-1799/1764.Form Array by Concatenating Subarrays of Another Array/README.md

@@ -2,7 +2,7 @@
 
 [English Version](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md)
 
-<!-- tags:贪心,数组,字符串匹配 -->
+<!-- tags:贪心,数组,双指针,字符串匹配 -->
 
 ## 题目描述
 

solution/1700-1799/1764.Form Array by Concatenating Subarrays of Another Array/README_EN.md

@@ -2,7 +2,7 @@
 
 [中文文档](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md)
 
-<!-- tags:Greedy,Array,String Matching -->
+<!-- tags:Greedy,Array,Two Pointers,String Matching -->
 
 ## Description
 

solution/1700-1799/1766.Tree of Coprimes/README.md

@@ -2,7 +2,7 @@
 
 [English Version](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md)
 
-<!-- tags:树,深度优先搜索,广度优先搜索,数组,数学,数论 -->
+<!-- tags:树,数组,数学,数论 -->
 
 ## 题目描述
 

solution/1700-1799/1766.Tree of Coprimes/README_EN.md

@@ -2,7 +2,7 @@
 
 [中文文档](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md)
 
-<!-- tags:Tree,Depth-First Search,Breadth-First Search,Array,Math,Number Theory -->
+<!-- tags:Tree,Array,Math,Number Theory -->
 
 ## Description