feat: update lc problems (doocs#3494)

Author: yanglbme

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -26,7 +26,7 @@ tags:
 
 <pre>
 <strong>输入: </strong>s = "abcabcbb"
-<strong>输出: </strong>3
+<strong>输出: </strong>3 
 <strong>解释:</strong> 因为无重复字符的最长子串是 <code>"abc"</code>，所以其长度为 3。
 </pre>
 

solution/0100-0199/0180.Consecutive Numbers/README_EN.md

@@ -26,7 +26,7 @@ tags:
 | num         | varchar |
 +-------------+---------+
 In SQL, id is the primary key for this table.
-id is an autoincrement column.
+id is an autoincrement column starting from 1.
 </pre>
 
 <p>&nbsp;</p>

solution/0300-0399/0303.Range Sum Query - Immutable/README.md

@@ -45,7 +45,7 @@ tags:
 <strong>解释：</strong>
 NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
 numArray.sumRange(0, 2); // return 1 ((-2) + 0 + 3)
-numArray.sumRange(2, 5); // return -1 (3 + (-5) + 2 + (-1))
+numArray.sumRange(2, 5); // return -1 (3 + (-5) + 2 + (-1)) 
 numArray.sumRange(0, 5); // return -3 ((-2) + 0 + 3 + (-5) + 2 + (-1))
 </pre>
 

solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md

@@ -39,10 +39,10 @@ tags:
 <p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/images/1626332422-wUpUHT-image.png" style="width: 200px;" /></p>
 
 <pre>
-<strong>输入:</strong>
+<strong>输入:</strong> 
 ["NumMatrix","sumRegion","sumRegion","sumRegion"]
 [[[[3,0,1,4,2],[5,6,3,2,1],[1,2,0,1,5],[4,1,0,1,7],[1,0,3,0,5]]],[2,1,4,3],[1,1,2,2],[1,2,2,4]]
-<strong>输出:</strong>
+<strong>输出:</strong> 
 [null, 8, 11, 12]
 
 <strong>解释:</strong>

solution/0600-0699/0640.Solve the Equation/README_EN.md

@@ -51,6 +51,7 @@ tags:
 	<li><code>3 &lt;= equation.length &lt;= 1000</code></li>
 	<li><code>equation</code> has exactly one <code>&#39;=&#39;</code>.</li>
 	<li><code>equation</code> consists of integers with an absolute value in the range <code>[0, 100]</code> without any leading zeros, and the variable <code>&#39;x&#39;</code>.</li>
+	<li>The input is generated that if there is a single solution, it will be an integer.</li>
 </ul>
 
 <!-- description:end -->

solution/0800-0899/0874.Walking Robot Simulation/README_EN.md

@@ -18,67 +18,91 @@ tags:
 
 <!-- description:start -->
 
-<p>A robot on an infinite XY-plane starts at point <code>(0, 0)</code> facing north. The robot can receive a sequence of these three possible types of <code>commands</code>:</p>
+<p>A robot on an infinite XY-plane starts at point <code>(0, 0)</code> facing north. The robot receives an array of integers <code>commands</code>, which represents a sequence of moves that it needs to execute. There are only three possible types of instructions the robot can receive:</p>
 
 <ul>
 	<li><code>-2</code>: Turn left <code>90</code> degrees.</li>
 	<li><code>-1</code>: Turn right <code>90</code> degrees.</li>
 	<li><code>1 &lt;= k &lt;= 9</code>: Move forward <code>k</code> units, one unit at a time.</li>
 </ul>
 
-<p>Some of the grid squares are <code>obstacles</code>. The <code>i<sup>th</sup></code> obstacle is at grid point <code>obstacles[i] = (x<sub>i</sub>, y<sub>i</sub>)</code>. If the robot runs into an obstacle, then it will instead stay in its current location and move on to the next command.</p>
+<p>Some of the grid squares are <code>obstacles</code>. The <code>i<sup>th</sup></code> obstacle is at grid point <code>obstacles[i] = (x<sub>i</sub>, y<sub>i</sub>)</code>. If the robot runs into an obstacle, it will stay in its current location (on the block adjacent to the obstacle) and move onto the next command.</p>
 
-<p>Return <em>the <strong>maximum Euclidean distance</strong> that the robot ever gets from the origin <strong>squared</strong> (i.e. if the distance is </em><code>5</code><em>, return </em><code>25</code><em>)</em>.</p>
+<p>Return the <strong>maximum squared Euclidean distance</strong> that the robot reaches at any point in its path (i.e. if the distance is <code>5</code>, return <code>25</code>).</p>
 
 <p><strong>Note:</strong></p>
 
 <ul>
+	<li>There can be an obstacle at <code>(0, 0)</code>. If this happens, the robot will ignore the obstacle until it has moved off the origin. However, it will be unable to return to <code>(0, 0)</code> due to the obstacle.</li>
 	<li>North means +Y direction.</li>
 	<li>East means +X direction.</li>
 	<li>South means -Y direction.</li>
 	<li>West means -X direction.</li>
-	<li>There can be obstacle in&nbsp;[0,0].</li>
 </ul>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> commands = [4,-1,3], obstacles = []
-<strong>Output:</strong> 25
-<strong>Explanation:</strong> The robot starts at (0, 0):
-1. Move north 4 units to (0, 4).
-2. Turn right.
-3. Move east 3 units to (3, 4).
-The furthest point the robot ever gets from the origin is (3, 4), which squared is 3<sup>2</sup> + 4<sup>2</sup> = 25 units away.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">commands = [4,-1,3], obstacles = []</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">25</span></p>
+
+<p><strong>Explanation: </strong></p>
+
+<p>The robot starts at <code>(0, 0)</code>:</p>
+
+<ol>
+	<li>Move north 4 units to <code>(0, 4)</code>.</li>
+	<li>Turn right.</li>
+	<li>Move east 3 units to <code>(3, 4)</code>.</li>
+</ol>
+
+<p>The furthest point the robot ever gets from the origin is <code>(3, 4)</code>, which squared is <code>3<sup>2</sup> + 4<sup>2 </sup>= 25</code> units away.</p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> commands = [4,-1,4,-2,4], obstacles = [[2,4]]
-<strong>Output:</strong> 65
-<strong>Explanation:</strong> The robot starts at (0, 0):
-1. Move north 4 units to (0, 4).
-2. Turn right.
-3. Move east 1 unit and get blocked by the obstacle at (2, 4), robot is at (1, 4).
-4. Turn left.
-5. Move north 4 units to (1, 8).
-The furthest point the robot ever gets from the origin is (1, 8), which squared is 1<sup>2</sup> + 8<sup>2</sup> = 65 units away.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">commands = [4,-1,4,-2,4], obstacles = [[2,4]]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">65</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The robot starts at <code>(0, 0)</code>:</p>
+
+<ol>
+	<li>Move north 4 units to <code>(0, 4)</code>.</li>
+	<li>Turn right.</li>
+	<li>Move east 1 unit and get blocked by the obstacle at <code>(2, 4)</code>, robot is at <code>(1, 4)</code>.</li>
+	<li>Turn left.</li>
+	<li>Move north 4 units to <code>(1, 8)</code>.</li>
+</ol>
+
+<p>The furthest point the robot ever gets from the origin is <code>(1, 8)</code>, which squared is <code>1<sup>2</sup> + 8<sup>2</sup> = 65</code> units away.</p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> commands = [6,-1,-1,6], obstacles = []
-<strong>Output:</strong> 36
-<strong>Explanation:</strong> The robot starts at (0, 0):
-1. Move north 6 units to (0, 6).
-2. Turn right.
-3. Turn right.
-4. Move south 6 units to (0, 0).
-The furthest point the robot ever gets from the origin is (0, 6), which squared is 6<sup>2</sup> = 36 units away.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">commands = [6,-1,-1,6], obstacles = [[0,0]]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">36</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The robot starts at <code>(0, 0)</code>:</p>
+
+<ol>
+	<li>Move north 6 units to <code>(0, 6)</code>.</li>
+	<li>Turn right.</li>
+	<li>Turn right.</li>
+	<li>Move south 5 units and get blocked by the obstacle at <code>(0,0)</code>, robot is at <code>(0, 1)</code>.</li>
+</ol>
+
+<p>The furthest point the robot ever gets from the origin is <code>(0, 6)</code>, which squared is <code>6<sup>2</sup> = 36</code> units away.</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

solution/1200-1299/1204.Last Person to Fit in the Bus/README_EN.md

@@ -40,6 +40,8 @@ weight is the weight of the person in kilograms.
 
 <p>Write a solution to find the <code>person_name</code> of the <strong>last person</strong> that can fit on the bus without exceeding the weight limit. The test cases are generated such that the first person does not exceed the weight limit.</p>
 
+<p><strong>Note</strong> that <em>only one</em> person can board the bus at any given turn.</p>
+
 <p>The&nbsp;result format is in the following example.</p>
 
 <p>&nbsp;</p>

solution/1600-1699/1632.Rank Transform of a Matrix/README.md

@@ -23,25 +23,25 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个 <code>m x n</code> 的矩阵 <code>matrix</code> ，请你返回一个新的矩阵<em> </em><code>answer</code> ，其中<em> </em><code>answer[row][col]</code> 是 <code>matrix[row][col]</code> 的秩。</p>
+<p>给你一个&nbsp;<code>m x n</code>&nbsp;的矩阵 <code>matrix</code>&nbsp;，请你返回一个新的矩阵<em>&nbsp;</em><code>answer</code>&nbsp;，其中<em>&nbsp;</em><code>answer[row][col]</code>&nbsp;是&nbsp;<code>matrix[row][col]</code>&nbsp;的秩。</p>
 
-<p>每个元素的 <b>秩</b> 是一个整数，表示这个元素相对于其他元素的大小关系，它按照如下规则计算：</p>
+<p>每个元素的&nbsp;<b>秩</b>&nbsp;是一个整数，表示这个元素相对于其他元素的大小关系，它按照如下规则计算：</p>
 
 <ul>
 	<li>秩是从 1 开始的一个整数。</li>
-	<li>如果两个元素 <code>p</code> 和 <code>q</code> 在 <strong>同一行</strong> 或者 <strong>同一列</strong> ，那么：
+	<li>如果两个元素&nbsp;<code>p</code> 和&nbsp;<code>q</code>&nbsp;在 <strong>同一行</strong>&nbsp;或者 <strong>同一列</strong>&nbsp;，那么：
 	<ul>
-		<li>如果 <code>p < q</code> ，那么 <code>rank(p) < rank(q)</code></li>
-		<li>如果 <code>p == q</code> ，那么 <code>rank(p) == rank(q)</code></li>
-		<li>如果 <code>p > q</code> ，那么 <code>rank(p) > rank(q)</code></li>
+		<li>如果&nbsp;<code>p &lt; q</code> ，那么&nbsp;<code>rank(p) &lt; rank(q)</code></li>
+		<li>如果&nbsp;<code>p == q</code>&nbsp;，那么&nbsp;<code>rank(p) == rank(q)</code></li>
+		<li>如果&nbsp;<code>p &gt; q</code>&nbsp;，那么&nbsp;<code>rank(p) &gt; rank(q)</code></li>
 	</ul>
 	</li>
-	<li><b>秩</b> 需要越 <strong>小</strong> 越好。</li>
+	<li><b>秩</b>&nbsp;需要越 <strong>小</strong>&nbsp;越好。</li>
 </ul>
 
-<p>题目保证按照上面规则 <code>answer</code> 数组是唯一的。</p>
+<p>题目保证按照上面规则&nbsp;<code>answer</code>&nbsp;数组是唯一的。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例 1：</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/images/rank1.jpg" style="width: 442px; height: 162px;" />
@@ -50,9 +50,9 @@ tags:
 <b>输出：</b>[[1,2],[2,3]]
 <strong>解释：</strong>
 matrix[0][0] 的秩为 1 ，因为它是所在行和列的最小整数。
-matrix[0][1] 的秩为 2 ，因为 matrix[0][1] > matrix[0][0] 且 matrix[0][0] 的秩为 1 。
-matrix[1][0] 的秩为 2 ，因为 matrix[1][0] > matrix[0][0] 且 matrix[0][0] 的秩为 1 。
-matrix[1][1] 的秩为 3 ，因为 matrix[1][1] > matrix[0][1]， matrix[1][1] > matrix[1][0] 且 matrix[0][1] 和 matrix[1][0] 的秩都为 2 。
+matrix[0][1] 的秩为 2 ，因为 matrix[0][1] &gt; matrix[0][0] 且 matrix[0][0] 的秩为 1 。
+matrix[1][0] 的秩为 2 ，因为 matrix[1][0] &gt; matrix[0][0] 且 matrix[0][0] 的秩为 1 。
+matrix[1][1] 的秩为 3 ，因为 matrix[1][1] &gt; matrix[0][1]， matrix[1][1] &gt; matrix[1][0] 且 matrix[0][1] 和 matrix[1][0] 的秩都为 2 。
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -69,22 +69,17 @@ matrix[1][1] 的秩为 3 ，因为 matrix[1][1] > matrix[0][1]， matrix[1][1] >
 <b>输出：</b>[[4,2,3],[1,3,4],[5,1,6],[1,3,4]]
 </pre>
 
-<p><strong>示例 4：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/images/rank4.jpg" style="width: 601px; height: 242px;" />
-<pre>
-<b>输入：</b>matrix = [[7,3,6],[1,4,5],[9,8,2]]
-<b>输出：</b>[[5,1,4],[1,2,3],[6,3,1]]
-</pre>
+<p>&nbsp;</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
 	<li><code>m == matrix.length</code></li>
 	<li><code>n == matrix[i].length</code></li>
-	<li><code>1 <= m, n <= 500</code></li>
-	<li><code>-10<sup>9</sup> <= matrix[row][col] <= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= m, n &lt;= 500</code></li>
+	<li><code>-10<sup>9</sup> &lt;= matrix[row][col] &lt;= 10<sup>9</sup></code></li>
 </ul>
 
 <!-- description:end -->

solution/2100-2199/2132.Stamping the Grid/README.md

@@ -51,8 +51,8 @@ tags:
 
 <p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2100-2199/2132.Stamping%20the%20Grid/images/ex2.png" style="width: 170px; height: 179px;"></p>
 
-<pre><b>输入：</b>grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2
-<b>输出：</b>false
+<pre><b>输入：</b>grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2 
+<b>输出：</b>false 
 <b>解释：</b>没办法放入邮票覆盖所有的空格子，且邮票不超出网格图以外。
 </pre>
 

solution/2100-2199/2132.Stamping the Grid/README_EN.md

@@ -48,8 +48,8 @@ tags:
 <p><strong class="example">Example 2:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2100-2199/2132.Stamping%20the%20Grid/images/ex2.png" style="width: 170px; height: 179px;" />
 <pre>
-<strong>Input:</strong> grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2
-<strong>Output:</strong> false
+<strong>Input:</strong> grid = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]], stampHeight = 2, stampWidth = 2 
+<strong>Output:</strong> false 
 <strong>Explanation:</strong> There is no way to fit the stamps onto all the empty cells without the stamps going outside the grid.
 </pre>
 

solution/2400-2499/2470.Number of Subarrays With LCM Equal to K/README.md

@@ -12,7 +12,7 @@ tags:
 
 <!-- problem:start -->
 
-# [2470. 最小公倍数为 K 的子数组数目](https://leetcode.cn/problems/number-of-subarrays-with-lcm-equal-to-k)
+# [2470. 最小公倍数等于 K 的子数组数目](https://leetcode.cn/problems/number-of-subarrays-with-lcm-equal-to-k)
 
 [English Version](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md)
 

solution/2500-2599/2506.Count Pairs Of Similar Strings/README.md

@@ -41,8 +41,8 @@ tags:
 <strong>输入：</strong>words = ["aba","aabb","abcd","bac","aabc"]
 <strong>输出：</strong>2
 <strong>解释：</strong>共有 2 对满足条件：
-- i = 0 且 j = 1 ：words[0] 和 words[1] 只由字符 'a' 和 'b' 组成。
-- i = 3 且 j = 4 ：words[3] 和 words[4] 只由字符 'a'、'b' 和 'c' 。
+- i = 0 且 j = 1 ：words[0] 和 words[1] 只由字符 'a' 和 'b' 组成。 
+- i = 3 且 j = 4 ：words[3] 和 words[4] 只由字符 'a'、'b' 和 'c' 。 
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -51,9 +51,9 @@ tags:
 <strong>输入：</strong>words = ["aabb","ab","ba"]
 <strong>输出：</strong>3
 <strong>解释：</strong>共有 3 对满足条件：
-- i = 0 且 j = 1 ：words[0] 和 words[1] 只由字符 'a' 和 'b' 组成。
-- i = 0 且 j = 2 ：words[0] 和 words[2] 只由字符 'a' 和 'b' 组成。
-- i = 1 且 j = 2 ：words[1] 和 words[2] 只由字符 'a' 和 'b' 组成。
+- i = 0 且 j = 1 ：words[0] 和 words[1] 只由字符 'a' 和 'b' 组成。 
+- i = 0 且 j = 2 ：words[0] 和 words[2] 只由字符 'a' 和 'b' 组成。 
+- i = 1 且 j = 2 ：words[1] 和 words[2] 只由字符 'a' 和 'b' 组成。 
 </pre>
 
 <p><strong>示例 3：</strong></p>

solution/2500-2599/2506.Count Pairs Of Similar Strings/README_EN.md

@@ -40,8 +40,8 @@ tags:
 <strong>Input:</strong> words = [&quot;aba&quot;,&quot;aabb&quot;,&quot;abcd&quot;,&quot;bac&quot;,&quot;aabc&quot;]
 <strong>Output:</strong> 2
 <strong>Explanation:</strong> There are 2 pairs that satisfy the conditions:
-- i = 0 and j = 1 : both words[0] and words[1] only consist of characters &#39;a&#39; and &#39;b&#39;.
-- i = 3 and j = 4 : both words[3] and words[4] only consist of characters &#39;a&#39;, &#39;b&#39;, and &#39;c&#39;.
+- i = 0 and j = 1 : both words[0] and words[1] only consist of characters &#39;a&#39; and &#39;b&#39;. 
+- i = 3 and j = 4 : both words[3] and words[4] only consist of characters &#39;a&#39;, &#39;b&#39;, and &#39;c&#39;. 
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -50,7 +50,7 @@ tags:
 <strong>Input:</strong> words = [&quot;aabb&quot;,&quot;ab&quot;,&quot;ba&quot;]
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> There are 3 pairs that satisfy the conditions:
-- i = 0 and j = 1 : both words[0] and words[1] only consist of characters &#39;a&#39; and &#39;b&#39;.
+- i = 0 and j = 1 : both words[0] and words[1] only consist of characters &#39;a&#39; and &#39;b&#39;. 
 - i = 0 and j = 2 : both words[0] and words[2] only consist of characters &#39;a&#39; and &#39;b&#39;.
 - i = 1 and j = 2 : both words[1] and words[2] only consist of characters &#39;a&#39; and &#39;b&#39;.
 </pre>

solution/2700-2799/2725.Interval Cancellation/README_EN.md

@@ -26,8 +26,6 @@ setTimeout(cancelFn, cancelTimeMs)
 
 <p>The function <code>fn</code> should be called with <code>args</code> immediately and then called again every&nbsp;<code>t</code> milliseconds&nbsp;until&nbsp;<code>cancelFn</code>&nbsp;is called at <code>cancelTimeMs</code> ms.</p>
 
-<p>&nbsp;</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/2700-2799/2750.Ways to Split Array Into Good Subarrays/README.md

@@ -7,6 +7,7 @@ source: 第 351 场周赛 Q3
 tags:
     - 数组
     - 数学
+    - 动态规划
 ---
 
 <!-- problem:start -->

solution/2700-2799/2750.Ways to Split Array Into Good Subarrays/README_EN.md

@@ -7,6 +7,7 @@ source: Weekly Contest 351 Q3
 tags:
     - Array
     - Math
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->

solution/3100-3199/3176.Find the Maximum Length of a Good Subsequence I/README.md

@@ -20,9 +20,9 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个 <strong>非负</strong>&nbsp;整数&nbsp;<code>k</code>&nbsp;。如果一个整数序列&nbsp;<code>seq</code>&nbsp;满足在范围下标范围&nbsp;<code>[0, seq.length - 2]</code>&nbsp;中存在 <strong>不超过</strong>&nbsp;<code>k</code>&nbsp;个下标 <code>i</code>&nbsp;满足&nbsp;<code>seq[i] != seq[i + 1]</code>&nbsp;，那么我们称这个整数序列为&nbsp;<strong>好</strong>&nbsp;序列。</p>
+<p>给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个 <strong>非负</strong>&nbsp;整数&nbsp;<code>k</code>&nbsp;。如果一个整数序列&nbsp;<code>seq</code>&nbsp;满足在下标范围&nbsp;<code>[0, seq.length - 2]</code>&nbsp;中&nbsp;<strong>最多只有</strong>&nbsp;<code>k</code>&nbsp;个下标 <code>i</code>&nbsp;满足&nbsp;<code>seq[i] != seq[i + 1]</code>&nbsp;，那么我们称这个整数序列为&nbsp;<strong>好</strong>&nbsp;序列。</p>
 
-<p>请你返回 <code>nums</code>&nbsp;中&nbsp;<strong>好</strong> <span data-keyword="subsequence-array">子序列</span>&nbsp;的最长长度</p>
+<p>请你返回 <code>nums</code>&nbsp;中&nbsp;<strong>好</strong> <span data-keyword="subsequence-array">子序列</span>&nbsp;的最长长度。</p>
 
 <p>&nbsp;</p>
 
@@ -35,7 +35,7 @@ tags:
 
 <p><strong>解释：</strong></p>
 
-<p>最长好子序列为&nbsp;<code>[<em><strong>1</strong></em>,<em><strong>2</strong></em>,<strong><em>1</em></strong>,<em><strong>1</strong></em>,3]</code>&nbsp;。</p>
+<p>最长好子序列为&nbsp;<code>[<u>1</u>,<u>2</u>,<u>1</u>,<u>1</u>,3]</code>&nbsp;。</p>
 </div>
 
 <p><strong class="example">示例 2：</strong></p>
@@ -47,7 +47,7 @@ tags:
 
 <p><strong>解释：</strong></p>
 
-<p>最长好子序列为&nbsp;<code>[<strong><em>1</em></strong>,2,3,4,5,<strong><em>1</em></strong>]</code>&nbsp;。</p>
+<p>最长好子序列为&nbsp;<code>[<u>1</u>,2,3,4,5,<u>1</u>]</code>&nbsp;。</p>
 </div>
 
 <p>&nbsp;</p>