feat: add solutions to lc problem: No.1756

No.1756.Design Most Recently Used Queue

Author: yanglbme

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

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

solution/0100-0199/0192.Word Frequency/README_EN.md

@@ -9,11 +9,8 @@
 <p>For simplicity sake, you may assume:</p>
 
 <ul>
-
     <li><code>words.txt</code> contains only lowercase characters and space <code>&#39; &#39;</code> characters.</li>
-
     <li>Each word must consist of lowercase characters only.</li>
-
     <li>Words are separated by one or more whitespace characters.</li>
 
 </ul>
@@ -47,9 +44,7 @@ day 1
 <p><b>Note:</b></p>
 
 <ul>
-
     <li>Don&#39;t worry about handling ties, it is guaranteed that each word&#39;s frequency count is unique.</li>
-
     <li>Could you write it in one-line using <a href="http://tldp.org/HOWTO/Bash-Prog-Intro-HOWTO-4.html">Unix pipes</a>?</li>
 
 </ul>

solution/0300-0399/0320.Generalized Abbreviation/README.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li>例如，<code>"abcde"</code> 可以缩写为：
-
     <ul>
     	<li><code>"a3e"</code>（<code>"bcd"</code> 变为 <code>"3"</code> ）</li>
     	<li><code>"1bcd1"</code>（<code>"a"</code> 和 <code>"e"</code> 都变为 <code>"1"</code>）<meta charset="UTF-8" /></li>

solution/0300-0399/0320.Generalized Abbreviation/README_EN.md

@@ -8,7 +8,6 @@
 
 <ul>
 	<li>For example, <code>&quot;abcde&quot;</code> can be abbreviated into:
-
     <ul>
     	<li><code>&quot;a3e&quot;</code> (<code>&quot;bcd&quot;</code> turned into <code>&quot;3&quot;</code>)</li>
     	<li><code>&quot;1bcd1&quot;</code> (<code>&quot;a&quot;</code> and <code>&quot;e&quot;</code> both turned into <code>&quot;1&quot;</code>)</li>

solution/0300-0399/0336.Palindrome Pairs/README.md

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

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

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

solution/0500-0599/0587.Erect the Fence/README.md

@@ -41,15 +41,10 @@
 <p><strong>注意:</strong></p>
 
 <ol>
-
     <li>所有的树应当被围在一起。你不能剪断绳子来包围树或者把树分成一组以上。</li>
-
     <li>输入的整数在 0 到 100 之间。</li>
-
     <li>花园至少有一棵树。</li>
-
     <li>所有树的坐标都是不同的。</li>
-
     <li>输入的点<strong>没有</strong>顺序。输出顺序也没有要求。</li>
 
 </ol>

solution/0500-0599/0594.Longest Harmonious Subsequence/README_EN.md

@@ -49,9 +49,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>
-
     <li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
 
 </ul>

solution/0600-0699/0679.24 Game/README.md

@@ -12,7 +12,6 @@
 
 <ul>
 	<li>除法运算符 <code>'/'</code> 表示实数除法，而不是整数除法。
-
     <ul>
     	<li>例如，&nbsp;<code>4 /(1 - 2 / 3)= 4 /(1 / 3)= 12</code>&nbsp;。</li>
     </ul>

solution/0600-0699/0679.24 Game/README_EN.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li>The division operator <code>&#39;/&#39;</code> represents real division, not integer division.
-
     <ul>
     	<li>For example, <code>4 / (1 - 2 / 3) = 4 / (1 / 3) = 12</code>.</li>
     </ul>