chore: remove black line in lc problems

Author: yanglbme

lcci/02.01.Remove Duplicate Node/README_EN.md

@@ -31,7 +31,6 @@
 <ol>
 	<li>The length of the list is within the range[0, 20000].</li>
     <li>The values of the list elements are within the range [0, 20000].</li>
-
 </ol>
 
 <p><strong>Follow Up: </strong></p>

solution/0100-0199/0160.Intersection of Two Linked Lists/README.md

@@ -34,7 +34,7 @@
 
 <p><strong>示例 1：</strong></p>
 
-<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_1_1.png" style="height:130px; width:400px" /></a></p>
+<p><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_1.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_1_1.png" style="height:130px; width:400px" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5], skipA = 2, skipB = 3
@@ -49,7 +49,7 @@
 
 <p><strong>示例&nbsp;2：</strong></p>
 
-<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_2.png" style="height:136px; width:350px" /></a></p>
+<p><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_2.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_2.png" style="height:136px; width:350px" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal&nbsp;= 2, listA = [1,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
@@ -61,7 +61,7 @@
 
 <p><strong>示例&nbsp;3：</strong></p>
 
-<p><a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_3.png" style="height:126px; width:200px" /></a></p>
+<p><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_3.png" target="_blank"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/images/160_example_3.png" style="height:126px; width:200px" /></a></p>
 
 <pre>
 <strong>输入：</strong>intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2

solution/0100-0199/0174.Dungeon Game/README.md

@@ -87,15 +87,10 @@ table.dungeon, .dungeon th, .dungeon td {
 <p><strong>说明:</strong></p>
 
 <ul>
-
     <li>
-
     <p>骑士的健康点数没有上限。</p>
-
     </li>
-
     <li>任何房间都可能对骑士的健康点数造成威胁，也可能增加骑士的健康点数，包括骑士进入的左上角房间以及公主被监禁的右下角房间。</li>
-
 </ul>
 
 ## 解法

solution/0700-0799/0777.Swap Adjacent in LR String/README.md

@@ -38,7 +38,7 @@ XRLXXRRLX
 
 **方法一：双指针**
 
-替换操作可以实际上是将 `L` 往左移动（`L` 左边为 `X` 时才能移动），`R` 往右移动（`R` 右边是 `X` 时才能移动），但 `L` 无法穿过 `R`。所以，如果去掉 `start` 和 `end` 中的所有 `X`，剩下的字符应该时相同的，否则返回 `false`。
+替换操作实际上是将 `L` 往左移动（`L` 左边为 `X` 时才能移动），`R` 往右移动（`R` 右边是 `X` 时才能移动），但 `L` 无法穿过 `R`。所以，如果去掉 `start` 和 `end` 中的所有 `X`，剩下的字符应该是相同的，否则返回 `false`。
 
 双指针遍历 `start` 和 `end`：
 

solution/0900-0999/0909.Snakes and Ladders/README.md

@@ -20,7 +20,6 @@
     </li>
     <li>传送玩家：如果目标方格 <code>next</code> 处存在蛇或梯子，那么玩家会传送到蛇或梯子的目的地。否则，玩家传送到目标方格 <code>next</code> 。&nbsp;</li>
     <li>当玩家到达编号 <code>n<sup>2</sup></code> 的方格时，游戏结束。</li>
-
 </ul>
 
 <p><code>r</code> 行 <code>c</code> 列的棋盘，按前述方法编号，棋盘格中可能存在 “蛇” 或 “梯子”；如果 <code>board[r][c] != -1</code>，那个蛇或梯子的目的地将会是 <code>board[r][c]</code>。编号为 <code>1</code> 和 <code>n<sup>2</sup></code> 的方格上没有蛇或梯子。</p>

solution/0900-0999/0909.Snakes and Ladders/README_EN.md

@@ -10,14 +10,12 @@
 
 <ul>
 	<li>Choose a destination square <code>next</code> with a label in the range <code>[curr + 1, min(curr + 6, n<sup>2</sup>)]</code>.
-
     <ul>
     	<li>This choice simulates the result of a standard <strong>6-sided die roll</strong>: i.e., there are always at most 6 destinations, regardless of the size of the board.</li>
     </ul>
     </li>
     <li>If <code>next</code> has a snake or ladder, you <strong>must</strong> move to the destination of that snake or ladder. Otherwise, you move to <code>next</code>.</li>
     <li>The game ends when you reach the square <code>n<sup>2</sup></code>.</li>
-
 </ul>
 
 <p>A board square on row <code>r</code> and column <code>c</code> has a snake or ladder if <code>board[r][c] != -1</code>. The destination of that snake or ladder is <code>board[r][c]</code>. Squares <code>1</code> and <code>n<sup>2</sup></code> do not have a snake or ladder.</p>

solution/0900-0999/0966.Vowel Spellchecker/README_EN.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li>Capitalization: If the query matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the case in the wordlist.
-
     <ul>
     	<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;YellOw&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
     	<li>Example: <code>wordlist = [&quot;Yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;Yellow&quot;</code></li>
@@ -24,7 +23,6 @@
     	<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yllw&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
     </ul>
     </li>
-
 </ul>
 
 <p>In addition, the spell checker operates under the following precedence rules:</p>

solution/1100-1199/1139.Largest 1-Bordered Square/README_EN.md

@@ -33,13 +33,9 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= grid.length &lt;= 100</code></li>
-
     <li><code>1 &lt;= grid[0].length &lt;= 100</code></li>
-
     <li><code>grid[i][j]</code> is <code>0</code> or <code>1</code></li>
-
 </ul>
 
 ## Solutions

solution/1100-1199/1187.Make Array Strictly Increasing/README_EN.md

@@ -51,11 +51,8 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= arr1.length, arr2.length &lt;= 2000</code></li>
-
     <li><code>0 &lt;= arr1[i], arr2[i] &lt;= 10^9</code></li>
-
 </ul>
 
 <p>&nbsp;</p>

solution/1200-1299/1248.Count Number of Nice Subarrays/README_EN.md

@@ -49,13 +49,9 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= nums.length &lt;= 50000</code></li>
-
     <li><code>1 &lt;= nums[i] &lt;= 10^5</code></li>
-
     <li><code>1 &lt;= k &lt;= nums.length</code></li>
-
 </ul>
 
 ## Solutions

solution/1200-1299/1256.Encode Number/README_EN.md

@@ -37,9 +37,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>0 &lt;= num &lt;= 10^9</code></li>
-
 </ul>
 
 ## Solutions

solution/1300-1399/1301.Number of Paths with Max Score/README_EN.md

@@ -39,9 +39,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>2 &lt;= board.length == board[i].length &lt;= 100</code></li>
-
 </ul>
 
 ## Solutions

solution/1300-1399/1396.Design Underground System/README_EN.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li><code>void checkIn(int id, string stationName, int t)</code>
-
     <ul>
     	<li>A customer with a card ID equal to <code>id</code>, checks in at the station <code>stationName</code> at time <code>t</code>.</li>
     	<li>A customer can only be checked into one place at a time.</li>
@@ -29,7 +28,6 @@
     	<li>There will be at least one customer that has traveled from <code>startStation</code> to <code>endStation</code> before <code>getAverageTime</code> is called.</li>
     </ul>
     </li>
-
 </ul>
 
 <p>You may assume all calls to the <code>checkIn</code> and <code>checkOut</code> methods are consistent. If a customer checks in at time <code>t<sub>1</sub></code> then checks out at time <code>t<sub>2</sub></code>, then <code>t<sub>1</sub> &lt; t<sub>2</sub></code>. All events happen in chronological order.</p>

solution/1500-1599/1523.Count Odd Numbers in an Interval Range/README_EN.md

@@ -33,9 +33,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>0 &lt;= low &lt;= high&nbsp;&lt;= 10^9</code></li>
-
 </ul>
 
 ## Solutions

solution/1500-1599/1533.Find the Index of the Large Integer/README.md

@@ -17,7 +17,6 @@
     </ul>
     </li>
     <li><code>int length()</code>：返回数组的长度。</li>
-
 </ul>
 
 <p>你最多可以调用函数&nbsp;<code>compareSub()</code>&nbsp;<strong>20 次</strong>。你可以认为这两个函数的时间复杂度都为&nbsp;<code>O(1)</code>&nbsp;。</p>

solution/1500-1599/1533.Find the Index of the Large Integer/README_EN.md

@@ -15,7 +15,6 @@
     </ul>
     </li>
     <li><code>int length()</code>: Returns the size of the array.</li>
-
 </ul>
 
 <p>You are allowed to call <code>compareSub()</code> <b>20 times</b> at most. You can assume both functions work in <code>O(1)</code> time.</p>

solution/1500-1599/1538.Guess the Majority in a Hidden Array/README.md

@@ -17,7 +17,6 @@
     </ul>
     </li>
     <li><code>int length()</code>：返回数组的长度。</li>
-
 </ul>
 
 <p>你可以调用&nbsp;<code>query()</code>&nbsp;最多&nbsp;<strong>2 * n 次</strong>，其中 n 等于&nbsp;<code>ArrayReader.length()</code>。</p>

solution/1500-1599/1538.Guess the Majority in a Hidden Array/README_EN.md

@@ -15,7 +15,6 @@
     </ul>
     </li>
     <li><code>int length()</code>: Returns the size of the array.</li>
-
 </ul>
 
 <p>You are allowed to call <code>query()</code> <b>2 * n times</b> at most where n is equal to <code>ArrayReader.length()</code>.</p>

solution/1500-1599/1557.Minimum Number of Vertices to Reach All Nodes/README_EN.md

@@ -43,17 +43,11 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>2 &lt;= n &lt;= 10^5</code></li>
-
     <li><code>1 &lt;= edges.length &lt;= min(10^5, n * (n - 1) / 2)</code></li>
-
     <li><code>edges[i].length == 2</code></li>
-
     <li><code>0 &lt;= from<sub>i,</sub>&nbsp;to<sub>i</sub> &lt; n</code></li>
-
     <li>All pairs <code>(from<sub>i</sub>, to<sub>i</sub>)</code> are distinct.</li>
-
 </ul>
 
 ## Solutions

solution/1500-1599/1585.Check If String Is Transformable With Substring Sort Operations/README_EN.md

@@ -8,12 +8,10 @@
 
 <ul>
 	<li>Choose a <strong>non-empty</strong> substring in <code>s</code> and sort it in place so the characters are in <strong>ascending order</strong>.
-
     <ul>
     	<li>For example, applying the operation on the underlined substring in <code>&quot;1<u>4234</u>&quot;</code> results in <code>&quot;1<u>2344</u>&quot;</code>.</li>
     </ul>
     </li>
-
 </ul>
 
 <p>Return <code>true</code> if <em>it is possible to transform <code>s</code> into <code>t</code></em>. Otherwise, return <code>false</code>.</p>

solution/1600-1699/1617.Count Subtrees With Max Distance Between Cities/README_EN.md

@@ -61,17 +61,11 @@ No subtree has two nodes where the max distance between them is 3.
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>2 &lt;= n &lt;= 15</code></li>
-
     <li><code>edges.length == n-1</code></li>
-
     <li><code>edges[i].length == 2</code></li>
-
     <li><code>1 &lt;= u<sub>i</sub>, v<sub>i</sub> &lt;= n</code></li>
-
     <li>All pairs <code>(u<sub>i</sub>, v<sub>i</sub>)</code> are distinct.</li>
-
 </ul>
 
 ## Solutions

solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README_EN.md

@@ -39,7 +39,6 @@ interface FontInfo {
 <ul>
     <li><code>getHeight(fontSize) &lt;= getHeight(fontSize+1)</code></li>
     <li><code>getWidth(fontSize, ch) &lt;= getWidth(fontSize+1, ch)</code></li>
-
 </ul>
 
 <p>Return <em>the maximum font size you can use to display </em><code>text</code><em> on the screen</em>. If <code>text</code> cannot fit on the display with any font size, return <code>-1</code>.</p>
@@ -88,7 +87,6 @@ interface FontInfo {
     <li><code>1 &lt;= fonts.length &lt;= 10<sup>5</sup></code></li>
     <li><code>1 &lt;= fonts[i] &lt;= 10<sup>5</sup></code></li>
     <li><code>fonts</code> is sorted in ascending order and does not contain duplicates.</li>
-
 </ul>
 
 ## Solutions

solution/1600-1699/1620.Coordinate With Maximum Network Quality/README.md

@@ -20,14 +20,12 @@
 
 <ul>
 	<li>坐标&nbsp;<code>(x1, y1)</code>&nbsp;字典序比另一个坐标&nbsp;<code>(x2, y2)</code> 小，需满足以下条件之一：
-
     <ul>
     	<li>要么&nbsp;<code>x1 &lt; x2</code>&nbsp;，</li>
     	<li>要么&nbsp;<code>x1 == x2</code> 且&nbsp;<code>y1 &lt; y2</code>&nbsp;。</li>
     </ul>
     </li>
     <li><code>⌊val⌋</code>&nbsp;表示小于等于&nbsp;<code>val</code>&nbsp;的最大整数（向下取整函数）。</li>
-
 </ul>
 
 <p>&nbsp;</p>

solution/1600-1699/1620.Coordinate With Maximum Network Quality/README_EN.md

@@ -16,14 +16,12 @@
 
 <ul>
 	<li>A coordinate <code>(x1, y1)</code> is lexicographically smaller than <code>(x2, y2)</code> if either:
-
     <ul>
     	<li><code>x1 &lt; x2</code>, or</li>
     	<li><code>x1 == x2</code> and <code>y1 &lt; y2</code>.</li>
     </ul>
     </li>
     <li><code>&lfloor;val&rfloor;</code> is the greatest integer less than or equal to <code>val</code> (the floor function).</li>
-
 </ul>
 
 <p>&nbsp;</p>

solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README_EN.md

@@ -71,17 +71,11 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>0 &lt;= n &lt;= 10<sup>4</sup></code></li>
-
     <li><code>-10<sup>9</sup>&nbsp;&lt;= PolyNode.coefficient &lt;= 10<sup>9</sup></code></li>
-
     <li><code>PolyNode.coefficient != 0</code></li>
-
     <li><code>0&nbsp;&lt;= PolyNode.power &lt;= 10<sup>9</sup></code></li>
-
     <li><code>PolyNode.power &gt; PolyNode.next.power</code></li>
-
 </ul>
 
 ## Solutions

solution/1600-1699/1649.Create Sorted Array through Instructions/README_EN.md

@@ -100,11 +100,8 @@ The total cost is 0 + 0 + 0 + 0 + 1 + 0 + 1 + 0 + 2 = 4.
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= instructions.length &lt;= 10<sup>5</sup></code></li>
-
     <li><code>1 &lt;= instructions[i] &lt;= 10<sup>5</sup></code></li>
-
 </ul>
 
 ## Solutions

solution/1600-1699/1657.Determine if Two Strings Are Close/README_EN.md

@@ -8,7 +8,6 @@
 
 <ul>
 	<li>Operation 1: Swap any two <strong>existing</strong> characters.
-
     <ul>
     	<li>For example, <code>a<u>b</u>cd<u>e</u> -&gt; a<u>e</u>cd<u>b</u></code></li>
     </ul>
@@ -18,7 +17,6 @@
     	<li>For example, <code><u>aa</u>c<u>abb</u> -&gt; <u>bb</u>c<u>baa</u></code> (all <code>a</code>&#39;s turn into <code>b</code>&#39;s, and all <code>b</code>&#39;s turn into <code>a</code>&#39;s)</li>
     </ul>
     </li>
-
 </ul>
 
 <p>You can use the operations on either string as many times as necessary.</p>

solution/1600-1699/1660.Correct a Binary Tree/README_EN.md

@@ -55,21 +55,13 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li>The number of nodes in the tree is in the range <code>[3, 10<sup>4</sup>]</code>.</li>
-
     <li><code>-10<sup>9</sup> &lt;= Node.val &lt;= 10<sup>9</sup></code></li>
-
     <li>All <code>Node.val</code> are <strong>unique</strong>.</li>
-
     <li><code>fromNode != toNode</code></li>
-
     <li><code>fromNode</code> and <code>toNode</code> will exist in the tree and will be on the same depth.</li>
-
     <li><code>toNode</code> is to the <strong>right</strong> of <code>fromNode</code>.</li>
-
     <li><code>fromNode.right</code> is <code>null</code> in the initial tree from the test data.</li>
-
 </ul>
 
 ## Solutions