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>

solution/0000-0099/0049.Group Anagrams/README_EN.md

@@ -27,11 +27,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>All inputs will be in lowercase.</li>
-
     <li>The order of your output does not&nbsp;matter.</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0050.Pow(x, n)/README_EN.md

@@ -41,11 +41,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>-100.0 &lt; <em>x</em> &lt; 100.0</li>
-
     <li><em>n</em> is a 32-bit signed integer, within the range&nbsp;[&minus;2<sup>31</sup>,&nbsp;2<sup>31&nbsp;</sup>&minus; 1]</li>
-
 </ul>
 
 ## Solutions

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

@@ -29,11 +29,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>Given <em>n</em> will be between 1 and 9 inclusive.</li>
-
     <li>Given&nbsp;<em>k</em>&nbsp;will be between 1 and <em>n</em>! inclusive.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0065.Valid Number/README_EN.md

@@ -39,15 +39,10 @@
 <p><strong>Note:</strong> It is intended for the problem statement to be ambiguous. You should gather all requirements up front before implementing one. However, here is a list of characters that can be in a valid decimal number:</p>
 
 <ul>
-
     <li>Numbers 0-9</li>
-
     <li>Exponent - &quot;e&quot;</li>
-
     <li>Positive/negative sign - &quot;+&quot;/&quot;-&quot;</li>
-
     <li>Decimal point - &quot;.&quot;</li>
-
 </ul>
 
 <p>Of course, the context of these characters also matters in the input.</p>

solution/0000-0099/0068.Text Justification/README_EN.md

@@ -15,13 +15,9 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>A word is defined as a character sequence consisting&nbsp;of non-space characters only.</li>
-
     <li>Each word&#39;s length is&nbsp;guaranteed to be greater than 0 and not exceed <em>maxWidth</em>.</li>
-
     <li>The input array <code>words</code>&nbsp;contains at least one word.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0073.Set Matrix Zeroes/README_EN.md

@@ -69,13 +69,9 @@
 <p><strong>Follow up:</strong></p>
 
 <ul>
-
     <li>A straight forward solution using O(<em>m</em><em>n</em>) space is probably a bad idea.</li>
-
     <li>A simple improvement uses O(<em>m</em> + <em>n</em>) space, but still not the best solution.</li>
-
     <li>Could you devise a constant space solution?</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0074.Search a 2D Matrix/README_EN.md

@@ -7,11 +7,8 @@
 <p>Write an efficient algorithm that searches for a value in an <em>m</em> x <em>n</em> matrix. This matrix has the following properties:</p>
 
 <ul>
-
     <li>Integers in each row are sorted from left to right.</li>
-
     <li>The first integer of each row is greater than the last integer of the previous row.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0000-0099/0075.Sort Colors/README_EN.md

@@ -21,13 +21,9 @@
 <p><strong>Follow up:</strong></p>
 
 <ul>
-
     <li>A rather straight forward solution is a two-pass algorithm using counting sort.<br />
-
     First, iterate the array counting number of 0&#39;s, 1&#39;s, and 2&#39;s, then overwrite array with total number of 0&#39;s, then 1&#39;s and followed by 2&#39;s.</li>
-
     <li>Could you come up with a&nbsp;one-pass algorithm using only constant space?</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0076.Minimum Window Substring/README_EN.md

@@ -19,11 +19,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>If there is no such window in S that covers all characters in T, return the empty string <code>&quot;&quot;</code>.</li>
-
     <li>If there is such window, you are guaranteed that there will always be only one unique minimum window in S.</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0081.Search in Rotated Sorted Array II/README_EN.md

@@ -31,11 +31,8 @@
 <p><strong>Follow up:</strong></p>
 
 <ul>
-
     <li>This is a follow up problem to&nbsp;<a href="/problems/search-in-rotated-sorted-array/description/">Search in Rotated Sorted Array</a>, where <code>nums</code> may contain duplicates.</li>
-
     <li>Would this affect the run-time complexity? How and why?</li>
-
 </ul>
 
 ## Solutions

solution/0000-0099/0088.Merge Sorted Array/README_EN.md

@@ -9,11 +9,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>The number of elements initialized in <em>nums1</em> and <em>nums2</em> are <em>m</em> and <em>n</em> respectively.</li>
-
     <li>You may assume that <em>nums1</em> has enough space (size that is greater or equal to <em>m</em> + <em>n</em>) to hold additional elements from <em>nums2</em>.</li>
-
 </ul>
 
 <p><strong>Example:</strong></p>

solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md

@@ -9,13 +9,9 @@
 <p>Assume a BST is defined as follows:</p>
 
 <ul>
-
     <li>The left subtree of a node contains only nodes with keys <strong>less than</strong> the node&#39;s key.</li>
-
     <li>The right subtree of a node contains only nodes with keys <strong>greater than</strong> the node&#39;s key.</li>
-
     <li>Both the left and right subtrees must also be binary search trees.</li>
-
 </ul>
 
 <p>&nbsp;</p>

solution/0000-0099/0099.Recover Binary Search Tree/README_EN.md

@@ -83,11 +83,8 @@
 <p><strong>Follow up:</strong></p>
 
 <ul>
-
     <li>A solution using O(<em>n</em>) space is pretty straight forward.</li>
-
     <li>Could you devise a constant space solution?</li>
-
 </ul>
 
 ## Solutions

solution/0100-0199/0126.Word Ladder II/README_EN.md

@@ -7,27 +7,18 @@
 <p>Given two words (<em>beginWord</em> and <em>endWord</em>), and a dictionary&#39;s word list, find all shortest transformation sequence(s) from <em>beginWord</em> to <em>endWord</em>, such that:</p>
 
 <ol>
-
     <li>Only one letter can be changed at a time</li>
-
     <li>Each transformed word must exist in the word list. Note that <em>beginWord</em> is <em>not</em> a transformed word.</li>
-
 </ol>
 
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>Return an empty list if there is no such transformation sequence.</li>
-
     <li>All words have the same length.</li>
-
     <li>All words contain only lowercase alphabetic characters.</li>
-
     <li>You may assume no duplicates in the word list.</li>
-
     <li>You may assume <em>beginWord</em> and <em>endWord</em> are non-empty and are not the same.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0100-0199/0134.Gas Station/README_EN.md

@@ -13,13 +13,9 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>If there exists a&nbsp;solution, it is guaranteed to be unique.</li>
-
     <li>Both input arrays are non-empty and have the same length.</li>
-
     <li>Each element in the input arrays is a non-negative integer.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0100-0199/0135.Candy/README_EN.md

@@ -9,11 +9,8 @@
 <p>You are giving candies to these children subjected to the following requirements:</p>
 
 <ul>
-
     <li>Each child must have at least one candy.</li>
-
     <li>Children with a higher rating get more candies than their neighbors.</li>
-
 </ul>
 
 <p>What is the minimum candies you must give?</p>

solution/0100-0199/0140.Word Break II/README_EN.md

@@ -9,11 +9,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>The same word in the dictionary may be reused multiple times in the segmentation.</li>
-
     <li>You may assume the dictionary does not contain duplicate words.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>

solution/0100-0199/0147.Insertion Sort List/README_EN.md

@@ -25,13 +25,9 @@ With each iteration one element (red) is removed from the input data and inserte
 <p><strong>Algorithm of Insertion Sort:</strong></p>
 
 <ol>
-
     <li>Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list.</li>
-
     <li>At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there.</li>
-
     <li>It repeats until no input elements remain.</li>
-
 </ol>
 
 <p><br />

solution/0100-0199/0150.Evaluate Reverse Polish Notation/README_EN.md

@@ -11,11 +11,8 @@
 <p><strong>Note:</strong></p>
 
 <ul>
-
     <li>Division between two integers should truncate toward zero.</li>
-
     <li>The given RPN expression is always valid. That means the expression would always evaluate to a result and there won&#39;t&nbsp;be any&nbsp;divide&nbsp;by zero operation.</li>
-
 </ul>
 
 <p><strong>Example 1:</strong></p>