docs: update readme documents

Author: yanglbme

all.json

@@ -36,7 +36,7 @@
 <p>你可以假设：</p>
 
 <ul>
-<li>0 &lt;= n (总金额) &lt;= 1000000</li>
+    <li>0 &lt;= n (总金额) &lt;= 1000000</li>
 </ul>
 
 ## 解法

images/cc-by-nc-sa-80x15.png

@@ -34,15 +34,10 @@ wordsFrequency.get("pen"); //returns 1
 <p><strong>Note: </strong></p>
 
 <ul>
-
     <li><code>There are only lowercase letters in book[i].</code></li>
-
     <li><code>1 &lt;= book.length &lt;= 100000</code></li>
-
     <li><code>1 &lt;= book[i].length &lt;= 10</code></li>
-
     <li><code>get</code>&nbsp;function will not be called more than&nbsp;100000 times.</li>
-
 </ul>
 
 ## Solutions

images/cc-by-nc-sa-88x31.png

@@ -0,0 +1 @@
+# LCP

lcci/08.11.Coin/README.md

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

lcci/16.02.Words Frequency/README_EN.md

@@ -54,11 +54,8 @@
 <p><b>Follow up</b>:</p>
 
 <ol>
-
     <li>Could you solve it in-place? Remember that the board needs to be updated at the same time: You cannot update some cells first and then use their updated values to update other cells.</li>
-
     <li>In this question, we represent the board using a 2D array. In principle, the board is infinite, which would cause problems when the active area encroaches the border of the array. How would you address these problems?</li>
-
 </ol>
 
 ## Solutions

lcp/README.md

@@ -12,15 +12,10 @@
 <p>现在给出在所有<strong>未挖出的</strong>方块中（&#39;M&#39;或者&#39;E&#39;）的下一个点击位置（行和列索引），根据以下规则，返回相应位置被点击后对应的面板：</p>
 
 <ol>
-
     <li>如果一个地雷（&#39;M&#39;）被挖出，游戏就结束了- 把它改为&nbsp;<strong>&#39;X&#39;</strong>。</li>
-
     <li>如果一个<strong>没有相邻地雷</strong>的空方块（&#39;E&#39;）被挖出，修改它为（&#39;B&#39;），并且所有和其相邻的方块都应该被递归地揭露。</li>
-
     <li>如果一个<strong>至少与一个地雷相邻</strong>的空方块（&#39;E&#39;）被挖出，修改它为数字（&#39;1&#39;到&#39;8&#39;），表示相邻地雷的数量。</li>
-
     <li>如果在此次点击中，若无更多方块可被揭露，则返回面板。</li>
-
 </ol>
 
 <p>&nbsp;</p>

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

@@ -9,13 +9,9 @@
 <p>Person A will NOT friend request person B (B != A) if any of the following conditions are true:</p>
 
 <ul>
-
     <li><code>age[B]&nbsp;&lt;= 0.5 * age[A]&nbsp;+ 7</code></li>
-
     <li><code>age[B]&nbsp;&gt; age[A]</code></li>
-
     <li><code>age[B]&nbsp;&gt; 100 &amp;&amp;&nbsp;age[A]&nbsp;&lt; 100</code></li>
-
 </ul>
 
 <p>Otherwise, A will friend request B.</p>
@@ -63,11 +59,8 @@
 <p>Notes:</p>
 
 <ul>
-
     <li><code>1 &lt;= ages.length&nbsp;&lt;= 20000</code>.</li>
-
     <li><code>1 &lt;= ages[i] &lt;= 120</code>.</li>
-
 </ul>
 
 ## Solutions

solution/0200-0299/0289.Game of Life/README_EN.md

@@ -53,13 +53,9 @@ We then go to room 3.  Since we were able to go to every room, we return true.
 <p><b>Note:</b></p>
 
 <ol>
-
     <li><code>1 &lt;= rooms.length &lt;=&nbsp;1000</code></li>
-
     <li><code>0 &lt;= rooms[i].length &lt;= 1000</code></li>
-
     <li>The number of keys in all rooms combined is at most&nbsp;<code>3000</code>.</li>
-
 </ol>
 
 ## Solutions

solution/0500-0599/0529.Minesweeper/README.md

@@ -9,11 +9,8 @@
 <p>You <strong>start at any tree&nbsp;of your choice</strong>, then repeatedly perform the following steps:</p>
 
 <ol>
-
     <li>Add one piece of fruit from this tree to your baskets.&nbsp; If you cannot, stop.</li>
-
     <li>Move to the next tree to the right of the current tree.&nbsp; If there is no tree to the right, stop.</li>
-
 </ol>
 
 <p>Note that you do not have any choice after the initial choice of starting tree:&nbsp;you must perform step 1, then step 2, then back to step 1, then step 2, and so on until you stop.</p>

solution/0800-0899/0825.Friends Of Appropriate Ages/README_EN.md

@@ -67,13 +67,9 @@ Path to get the maximum gold, 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7.
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= grid.length,&nbsp;grid[i].length &lt;= 15</code></li>
-
     <li><code>0 &lt;= grid[i][j] &lt;= 100</code></li>
-
     <li>There are at most <strong>25&nbsp;</strong>cells containing gold.</li>
-
 </ul>
 
 ## Solutions

solution/0800-0899/0841.Keys and Rooms/README_EN.md

@@ -102,17 +102,11 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= moves.length &lt;= 9</code></li>
-
     <li><code>moves[i].length == 2</code></li>
-
     <li><code>0 &lt;= moves[i][j] &lt;= 2</code></li>
-
     <li>There are no repeated elements on <code>moves</code>.</li>
-
     <li><code>moves</code> follow the rules of tic tac toe.</li>
-
 </ul>
 
 ## Solutions

solution/0900-0999/0904.Fruit Into Baskets/README_EN.md

@@ -78,11 +78,8 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= arr.length &lt;= 300</code></li>
-
     <li><code>1 &lt;= arr[i] &lt;= 10^8</code></li>
-
 </ul>
 
 ## Solutions