feat: update lc problems

Author: yanglbme

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -11,22 +11,22 @@
 <p>You can return the answer in any order.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [2,7,11,15], target = 9
 <strong>Output:</strong> [0,1]
 <strong>Explanation:</strong> Because nums[0] + nums[1] == 9, we return [0, 1].
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [3,2,4], target = 6
 <strong>Output:</strong> [1,2]
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [3,3], target = 6

solution/0000-0099/0002.Add Two Numbers/README_EN.md

@@ -9,22 +9,22 @@
 <p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0002.Add%20Two%20Numbers/images/addtwonumber1.jpg" style="width: 483px; height: 342px;" />
 <pre>
 <strong>Input:</strong> l1 = [2,4,3], l2 = [5,6,4]
 <strong>Output:</strong> [7,0,8]
 <strong>Explanation:</strong> 342 + 465 = 807.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> l1 = [0], l2 = [0]
 <strong>Output:</strong> [0]
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -7,23 +7,23 @@
 <p>Given a string <code>s</code>, find the length of the <strong>longest substring</strong> without repeating characters.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;abcabcbb&quot;
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> The answer is &quot;abc&quot;, with the length of 3.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;bbbbb&quot;
 <strong>Output:</strong> 1
 <strong>Explanation:</strong> The answer is &quot;b&quot;, with the length of 1.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;pwwkew&quot;

solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md

@@ -9,15 +9,15 @@
 <p>The overall run time complexity should be <code>O(log (m+n))</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [1,3], nums2 = [2]
 <strong>Output:</strong> 2.00000
 <strong>Explanation:</strong> merged array = [1,2,3] and median is 2.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [1,2], nums2 = [3,4]

solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md

@@ -9,15 +9,15 @@
 <p>A string is called a palindrome string if the reverse of that string is the same as the original string.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;babad&quot;
 <strong>Output:</strong> &quot;bab&quot;
 <strong>Explanation:</strong> &quot;aba&quot; is also a valid answer.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;cbbd&quot;

solution/0000-0099/0006.Zigzag Conversion/README_EN.md

@@ -21,14 +21,14 @@ string convert(string s, int numRows);
 </pre>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;PAYPALISHIRING&quot;, numRows = 3
 <strong>Output:</strong> &quot;PAHNAPLSIIGYIR&quot;
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;PAYPALISHIRING&quot;, numRows = 4
@@ -40,7 +40,7 @@ Y A   H R
 P     I
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;A&quot;, numRows = 1

solution/0000-0099/0007.Reverse Integer/README_EN.md

@@ -9,21 +9,21 @@
 <p><strong>Assume the environment does not allow you to store 64-bit integers (signed or unsigned).</strong></p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = 123
 <strong>Output:</strong> 321
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = -123
 <strong>Output:</strong> -321
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = 120

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

@@ -25,7 +25,7 @@
 </ul>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;42&quot;
@@ -41,7 +41,7 @@ The parsed integer is 42.
 Since 42 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is 42.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;   -42&quot;
@@ -57,7 +57,7 @@ The parsed integer is -42.
 Since -42 is in the range [-2<sup>31</sup>, 2<sup>31</sup> - 1], the final result is -42.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;4193 with words&quot;

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -13,23 +13,23 @@
 </ul>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = 121
 <strong>Output:</strong> true
 <strong>Explanation:</strong> 121 reads as 121 from left to right and from right to left.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = -121
 <strong>Output:</strong> false
 <strong>Explanation:</strong> From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> x = 10

solution/0000-0099/0010.Regular Expression Matching/README_EN.md

@@ -14,23 +14,23 @@
 <p>The matching should cover the <strong>entire</strong> input string (not partial).</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;aa&quot;, p = &quot;a&quot;
 <strong>Output:</strong> false
 <strong>Explanation:</strong> &quot;a&quot; does not match the entire string &quot;aa&quot;.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;aa&quot;, p = &quot;a*&quot;
 <strong>Output:</strong> true
 <strong>Explanation:</strong> &#39;*&#39; means zero or more of the preceding element, &#39;a&#39;. Therefore, by repeating &#39;a&#39; once, it becomes &quot;aa&quot;.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;ab&quot;, p = &quot;.*&quot;

solution/0000-0099/0011.Container With Most Water/README_EN.md

@@ -13,15 +13,15 @@
 <p><strong>Notice</strong> that you may not slant the container.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0011.Container%20With%20Most%20Water/images/question_11.jpg" style="width: 600px; height: 287px;" />
 <pre>
 <strong>Input:</strong> height = [1,8,6,2,5,4,8,3,7]
 <strong>Output:</strong> 49
 <strong>Explanation:</strong> The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> height = [1,1]

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

@@ -29,23 +29,23 @@ M             1000</pre>
 <p>Given an integer, convert it to a roman numeral.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> num = 3
 <strong>Output:</strong> &quot;III&quot;
 <strong>Explanation:</strong> 3 is represented as 3 ones.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> num = 58
 <strong>Output:</strong> &quot;LVIII&quot;
 <strong>Explanation:</strong> L = 50, V = 5, III = 3.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> num = 1994

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

@@ -29,23 +29,23 @@ M             1000</pre>
 <p>Given a roman numeral, convert it to an integer.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;III&quot;
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> III = 3.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;LVIII&quot;
 <strong>Output:</strong> 58
 <strong>Explanation:</strong> L = 50, V= 5, III = 3.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;MCMXCIV&quot;

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -184,7 +184,7 @@ end
  * @param {string[]} strs
  * @return {string}
  */
-var longestCommonPrefix = function(strs) {
+var longestCommonPrefix = function (strs) {
     for (let j = 0; j < strs[0].length; j++) {
         for (let i = 0; i < strs.length; i++) {
             if (strs[0][j] !== strs[i][j]) {

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -9,14 +9,14 @@
 <p>If there is no common prefix, return an empty string <code>&quot;&quot;</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> strs = [&quot;flower&quot;,&quot;flow&quot;,&quot;flight&quot;]
 <strong>Output:</strong> &quot;fl&quot;
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> strs = [&quot;dog&quot;,&quot;racecar&quot;,&quot;car&quot;]
@@ -175,7 +175,7 @@ end
  * @param {string[]} strs
  * @return {string}
  */
-var longestCommonPrefix = function(strs) {
+var longestCommonPrefix = function (strs) {
     for (let j = 0; j < strs[0].length; j++) {
         for (let i = 0; i < strs.length; i++) {
             if (strs[0][j] !== strs[i][j]) {

solution/0000-0099/0015.3Sum/README_EN.md

@@ -9,7 +9,7 @@
 <p>Notice that the solution set must not contain duplicate triplets.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [-1,0,1,2,-1,-4]
@@ -22,15 +22,15 @@ The distinct triplets are [-1,0,1] and [-1,-1,2].
 Notice that the order of the output and the order of the triplets does not matter.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [0,1,1]
 <strong>Output:</strong> []
 <strong>Explanation:</strong> The only possible triplet does not sum up to 0.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [0,0,0]