style: update problems description

Author: yanglbme

index.html

@@ -36,7 +36,6 @@
         '/','/solution/','/lcof/','/lcci/', '/basic/'
       ],
       auto2top: true,
-      loadSidebar: 'summary.md',
       subMaxLevel: 2,
       alias: {
         '/lcci/.*/summary.md': '/lcci/summary.md',

solution/0000-0099/0020.Valid Parentheses/README_EN.md

@@ -9,11 +9,8 @@
 <p>An input string is valid if:</p>
 
 <ol>
-
     <li>Open brackets must be closed by the same type of brackets.</li>
-
     <li>Open brackets must be closed in the correct order.</li>
-
 </ol>
 
 <p>Note that an empty string is&nbsp;also considered valid.</p>

solution/0000-0099/0036.Valid Sudoku/README_EN.md

@@ -7,13 +7,9 @@
 <p>Determine if a&nbsp;9x9 Sudoku board&nbsp;is valid.&nbsp;Only the filled cells need to be validated&nbsp;<strong>according to the following rules</strong>:</p>
 
 <ol>
-
     <li>Each row&nbsp;must contain the&nbsp;digits&nbsp;<code>1-9</code> without repetition.</li>
-
     <li>Each column must contain the digits&nbsp;<code>1-9</code>&nbsp;without repetition.</li>
-
     <li>Each of the 9 <code>3x3</code> sub-boxes of the grid must contain the digits&nbsp;<code>1-9</code>&nbsp;without repetition.</li>
-
 </ol>
 
 <p><img src="https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" /><br />

solution/0000-0099/0037.Sudoku Solver/README_EN.md

@@ -9,13 +9,9 @@
 <p>A&nbsp;sudoku solution must satisfy <strong>all of&nbsp;the following rules</strong>:</p>
 
 <ol>
-
     <li>Each of the digits&nbsp;<code>1-9</code> must occur exactly&nbsp;once in each row.</li>
-
     <li>Each of the digits&nbsp;<code>1-9</code>&nbsp;must occur&nbsp;exactly once in each column.</li>
-
     <li>Each of the the digits&nbsp;<code>1-9</code> must occur exactly once in each of the 9 <code>3x3</code> sub-boxes of the grid.</li>
-
 </ol>
 
 <p>Empty cells are indicated by the character <code>&#39;.&#39;</code>.</p>

solution/0000-0099/0043.Multiply Strings/README_EN.md

@@ -27,15 +27,10 @@
 <p><strong>Note:</strong></p>
 
 <ol>
-
     <li>The length of both <code>num1</code> and <code>num2</code> is &lt; 110.</li>
-
     <li>Both <code>num1</code> and <code>num2</code> contain&nbsp;only digits <code>0-9</code>.</li>
-
     <li>Both <code>num1</code> and <code>num2</code>&nbsp;do not contain any leading zero, except the number 0 itself.</li>
-
     <li>You <strong>must not use any built-in BigInteger library</strong> or <strong>convert the inputs to integer</strong> directly.</li>
-
 </ol>
 
 ## Solutions

solution/0000-0099/0060.Permutation Sequence/README_EN.md

@@ -9,19 +9,12 @@
 <p>By listing and labeling all of the permutations in order, we get the following sequence for <em>n</em> = 3:</p>
 
 <ol>
-
     <li><code>&quot;123&quot;</code></li>
-
     <li><code>&quot;132&quot;</code></li>
-
     <li><code>&quot;213&quot;</code></li>
-
     <li><code>&quot;231&quot;</code></li>
-
     <li><code>&quot;312&quot;</code></li>
-
     <li><code>&quot;321&quot;</code></li>
-
 </ol>
 
 <p>Given <em>n</em> and <em>k</em>, return the <em>k</em><sup>th</sup> permutation sequence.</p>

solution/0000-0099/0072.Edit Distance/README_EN.md

@@ -9,13 +9,9 @@
 <p>You have the following 3 operations permitted on a word:</p>
 
 <ol>
-
     <li>Insert a character</li>
-
     <li>Delete a character</li>
-
     <li>Replace a character</li>
-
 </ol>
 
 <p><strong>Example 1:</strong></p>

solution/0100-0199/0165.Compare Version Numbers/README_EN.md

@@ -69,7 +69,6 @@ If <code><em>version1</em> &gt; <em>version2</em></code> return <code>1;</code>&
 <ol>
 
 <li>Version strings are composed of numeric strings separated by dots <code>.</code> and this numeric strings <strong>may</strong> have leading zeroes. </li>
-
 <li>Version strings do not start or end with dots, and they will not be two consecutive dots.</li>
 
 </ol>

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

@@ -45,7 +45,6 @@ day 1
 <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>
 
 ## Solutions

solution/0200-0299/0210.Course Schedule II/README_EN.md

@@ -41,11 +41,8 @@
 <p><strong>Note:</strong></p>
 
 <ol>
-
     <li>The input prerequisites is a graph represented by <strong>a list of edges</strong>, not adjacency matrices. Read more about <a href="https://www.khanacademy.org/computing/computer-science/algorithms/graph-representation/a/representing-graphs" target="_blank">how a graph is represented</a>.</li>
-
     <li>You may assume that there are no duplicate edges in the input prerequisites.</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0212.Word Search II/README_EN.md

@@ -41,11 +41,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>All inputs are consist of lowercase letters <code>a-z</code>.</li>
-
     <li>The values of&nbsp;<code>words</code> are distinct.</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0260.Single Number III/README_EN.md

@@ -17,11 +17,8 @@
 <p><b>Note</b>:</p>
 
 <ol>
-
     <li>The order of the result is not important. So in the above example, <code>[5, 3]</code> is also correct.</li>
-
     <li>Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0263.Ugly Number/README_EN.md

@@ -45,11 +45,8 @@
 <p><strong>Note:</strong></p>
 
 <ol>
-
     <li><code>1</code> is typically treated as an ugly number.</li>
-
     <li>Input is within the 32-bit signed integer range:&nbsp;[&minus;2<sup>31</sup>,&nbsp; 2<sup>31&nbsp;</sup>&minus; 1].</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0264.Ugly Number II/README_EN.md

@@ -21,11 +21,8 @@
 <p><strong>Note: </strong>&nbsp;</p>
 
 <ol>
-
     <li><code>1</code> is typically treated as an ugly number.</li>
-
     <li><code>n</code> <b>does not exceed 1690</b>.</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0283.Move Zeroes/README_EN.md

@@ -17,11 +17,8 @@
 <p><b>Note</b>:</p>
 
 <ol>
-
     <li>You must do this <b>in-place</b> without making a copy of the array.</li>
-
     <li>Minimize the total number of operations.</li>
-
 </ol>
 
 ## Solutions

solution/0200-0299/0287.Find the Duplicate Number/README_EN.md

@@ -27,15 +27,10 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>You <b>must not</b> modify the array (assume the array is read only).</li>
-
     <li>You must use only constant, <i>O</i>(1) extra space.</li>
-
     <li>Your runtime complexity should be less than <em>O</em>(<em>n</em><sup>2</sup>).</li>
-
     <li>There is only one duplicate number in the array, but it could be repeated more than once.</li>
-
 </ol>
 
 ## Solutions

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

@@ -9,15 +9,10 @@
 <p>Given a <i>board</i> with <i>m</i> by <i>n</i> cells, each cell has an initial state <i>live</i> (1) or <i>dead</i> (0). Each cell interacts with its <a href="https://en.wikipedia.org/wiki/Moore_neighborhood" target="_blank">eight neighbors</a> (horizontal, vertical, diagonal) using the following four rules (taken from the above Wikipedia article):</p>
 
 <ol>
-
     <li>Any live cell with fewer than two live neighbors dies, as if caused by under-population.</li>
-
     <li>Any live cell with two or three live neighbors lives on to the next generation.</li>
-
     <li>Any live cell with more than three live neighbors dies, as if by over-population..</li>
-
     <li>Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.</li>
-
 </ol>
 
 <p>Write a function to compute the next state (after one update) of the board given its current state.&nbsp;<span>The next state is created by applying the above rules simultaneously to every cell in the current state, where&nbsp;births and deaths occur simultaneously.</span></p>

solution/0200-0299/0295.Find Median from Data Stream/README_EN.md

@@ -42,11 +42,8 @@ findMedian() -> 2
 <p><strong>Follow up:</strong></p>
 
 <ol>
-
     <li>If all integer numbers from the stream are between 0&nbsp;and 100, how would you optimize it?</li>
-
     <li>If 99% of all integer numbers from the stream are between 0 and 100, how would you optimize it?</li>
-
 </ol>
 
 ## Solutions

solution/0300-0399/0307.Range Sum Query - Mutable/README_EN.md

@@ -27,11 +27,8 @@ sumRange(0, 2) -> 8
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>The array is only modifiable by the <i>update</i> function.</li>
-
     <li>You may assume the number of calls to <i>update</i> and <i>sumRange</i> function is distributed evenly.</li>
-
 </ol>
 
 ## Solutions

solution/0300-0399/0332.Reconstruct Itinerary/README_EN.md

@@ -9,13 +9,9 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string. For example, the itinerary <code>[&quot;JFK&quot;, &quot;LGA&quot;]</code> has a smaller lexical order than <code>[&quot;JFK&quot;, &quot;LGB&quot;]</code>.</li>
-
     <li>All airports are represented by three capital letters (IATA code).</li>
-
     <li>You may assume all tickets form at least one valid itinerary.</li>
-
 </ol>
 
 <p><b>Example 1:</b></p>

solution/0300-0399/0363.Max Sum of Rectangle No Larger Than K/README_EN.md

@@ -21,11 +21,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>The rectangle inside the matrix must have an area &gt; 0.</li>
-
     <li>What if the number of rows is much larger than the number of columns?</li>
-
 </ol>
 
 ## Solutions

solution/0400-0499/0416.Partition Equal Subset Sum/README_EN.md

@@ -9,11 +9,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>Each of the array element will not exceed 100.</li>
-
     <li>The array size will not exceed 200.</li>
-
 </ol>
 
 <p>&nbsp;</p>

solution/0400-0499/0417.Pacific Atlantic Water Flow/README_EN.md

@@ -13,11 +13,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>The order of returned grid coordinates does not matter.</li>
-
     <li>Both <i>m</i> and <i>n</i> are less than 150.</li>
-
 </ol>
 
 <p>&nbsp;</p>

solution/0400-0499/0433.Minimum Genetic Mutation/README_EN.md

@@ -17,13 +17,9 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>Starting point is assumed to be valid, so it might not be included in the bank.</li>
-
     <li>If multiple mutations are needed, all mutations during in the sequence must be valid.</li>
-
     <li>You may assume start and end string is not the same.</li>
-
 </ol>
 
 <p>&nbsp;</p>

solution/0400-0499/0436.Find Right Interval/README_EN.md

@@ -11,11 +11,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>You may assume the interval&#39;s end point is always bigger than its start point.</li>
-
     <li>You may assume none of these intervals have the same start point.</li>
-
 </ol>
 
 <p>&nbsp;</p>

solution/0400-0499/0443.String Compression/README_EN.md

@@ -97,11 +97,8 @@ Notice each digit has it's own entry in the array.
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>All characters have an ASCII value in <code>[35, 126]</code>.</li>
-
     <li><code>1 &lt;= len(chars) &lt;= 1000</code>.</li>
-
 </ol>
 
 ## Solutions

solution/0400-0499/0457.Circular Array Loop/README_EN.md

@@ -49,13 +49,9 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>-1000 &le;&nbsp;nums[i] &le;&nbsp;1000</li>
-
     <li>nums[i] &ne;&nbsp;0</li>
-
     <li>1 &le;&nbsp;nums.length &le; 5000</li>
-
 </ol>
 
 <p>&nbsp;</p>

solution/0400-0499/0458.Poor Pigs/README_EN.md

@@ -19,13 +19,9 @@
 <p><strong>Note:</strong></p>
 
 <ol>
-
     <li>A pig can be allowed to drink simultaneously on as many buckets as one would like, and the feeding takes no time.</li>
-
     <li>After a pig has instantly finished drinking buckets, there has to be a <strong>cool down time</strong> of <em>m&nbsp;</em>minutes. During this time, only observation is allowed and no feedings at all.</li>
-
     <li>Any given bucket can be sampled an infinite number of times (by an unlimited number of pigs).</li>
-
 </ol>
 
 ## Solutions

solution/0400-0499/0470.Implement Rand10() Using Rand7()/README_EN.md

@@ -55,23 +55,17 @@
 <p><strong>Note:</strong></p>
 
 <ol>
-
     <li><code>rand7</code> is predefined.</li>
-
     <li>Each testcase has one argument:&nbsp;<code>n</code>, the number of times that <code>rand10</code> is called.</li>
-
 </ol>
 
 <p>&nbsp;</p>
 
 <p><strong>Follow up:</strong></p>
 
 <ol>
-
     <li>What is the <a href="https://en.wikipedia.org/wiki/Expected_value" target="_blank">expected value</a>&nbsp;for the number of calls to&nbsp;<code>rand7()</code>&nbsp;function?</li>
-
     <li>Could you minimize the number of calls to <code>rand7()</code>?</li>
-
 </ol>
 
 </div>

solution/0400-0499/0474.Ones and Zeroes/README_EN.md

@@ -13,11 +13,8 @@
 <p><b>Note:</b></p>
 
 <ol>
-
     <li>The given numbers of <code>0s</code> and <code>1s</code> will both not exceed <code>100</code></li>
-
     <li>The size of given string array won&#39;t exceed <code>600</code>.</li>
-
 </ol>
 
 <p>&nbsp;</p>