style: update problems description

Author: yanglbme

.github/workflows/prettier.yml

@@ -1,10 +1,8 @@
 name: Prettier
 
 on:
-  pull_request:
   push:
-    branches:
-    - main
+    branches: [ main ]
 
 jobs:
   prettier:

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -17,11 +17,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>Only the space character <code>&#39; &#39;</code> is considered as whitespace character.</li>
-
     <li>Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [&minus;2<sup>31</sup>,&nbsp; 2<sup>31&nbsp;</sup>&minus; 1]. If the numerical value is out of the range of representable values, INT_MAX (2<sup>31&nbsp;</sup>&minus; 1) or INT_MIN (&minus;2<sup>31</sup>) is returned.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0012.Integer to Roman/README_EN.md

@@ -29,13 +29,9 @@ M             1000</pre>
 <p>Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not <code>IIII</code>. Instead, the number four is written as <code>IV</code>. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as <code>IX</code>. There are six instances where subtraction is used:</p>
 
 <ul>
-
     <li><code>I</code> can be placed before <code>V</code> (5) and <code>X</code> (10) to make 4 and 9.&nbsp;</li>
-
     <li><code>X</code> can be placed before <code>L</code> (50) and <code>C</code> (100) to make 40 and 90.&nbsp;</li>
-
     <li><code>C</code> can be placed before <code>D</code> (500) and <code>M</code> (1000) to make 400 and 900.</li>
-
 </ul>
 
 <p>Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.</p>

solution/0000-0099/0013.Roman to Integer/README_EN.md

@@ -29,13 +29,9 @@ M             1000</pre>
 <p>Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not <code>IIII</code>. Instead, the number four is written as <code>IV</code>. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as <code>IX</code>. There are six instances where subtraction is used:</p>
 
 <ul>
-
     <li><code>I</code> can be placed before <code>V</code> (5) and <code>X</code> (10) to make 4 and 9.&nbsp;</li>
-
     <li><code>X</code> can be placed before <code>L</code> (50) and <code>C</code> (100) to make 40 and 90.&nbsp;</li>
-
     <li><code>C</code> can be placed before <code>D</code> (500) and <code>M</code> (1000) to make 400 and 900.</li>
-
 </ul>
 
 <p>Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.</p>

solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md

@@ -23,11 +23,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>Only constant extra memory is allowed.</li>
-
     <li>You may not alter the values in the list&#39;s nodes, only nodes itself may be changed.</li>
-
 </ul>
 
 ## Solutions

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

@@ -93,15 +93,10 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>A Sudoku board (partially filled) could be valid but is not necessarily solvable.</li>
-
     <li>Only the filled cells need to be validated according to the mentioned&nbsp;rules.</li>
-
     <li>The given board&nbsp;contain only digits <code>1-9</code> and the character <code>&#39;.&#39;</code>.</li>
-
     <li>The given board size is always <code>9x9</code>.</li>
-
 </ul>
 
 ## Solutions

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

@@ -31,13 +31,9 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>The given board&nbsp;contain only digits <code>1-9</code> and the character <code>&#39;.&#39;</code>.</li>
-
     <li>You may assume that the given Sudoku puzzle will have a single unique solution.</li>
-
     <li>The given board size is always <code>9x9</code>.</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0039.Combination Sum/README_EN.md

@@ -11,11 +11,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>All numbers (including <code>target</code>) will be positive integers.</li>
-
     <li>The solution set must not contain duplicate combinations.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0040.Combination Sum II/README_EN.md

@@ -11,11 +11,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>All numbers (including <code>target</code>) will be positive integers.</li>
-
     <li>The solution set must not contain duplicate combinations.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0044.Wildcard Matching/README_EN.md

@@ -19,11 +19,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li><code>s</code>&nbsp;could be empty and contains only lowercase letters <code>a-z</code>.</li>
-
     <li><code>p</code> could be empty and contains only lowercase letters <code>a-z</code>, and characters like <code><font face="monospace">?</font></code>&nbsp;or&nbsp;<code>*</code>.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>