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