feat: add solutions to lc problems: No.2441~2444

* No.2441.Largest Positive Integer That Exists With Its Negative
* No.2442.Count Number of Distinct Integers After Reverse Operations
* No.2443.Sum of Number and Its Reverse
* No.2444.Count Subarrays With Fixed Bounds

Author: yanglbme

solution/0000-0099/0016.3Sum Closest/README_EN.md

@@ -31,7 +31,7 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>3 &lt;= nums.length &lt;= 1000</code></li>
+	<li><code>3 &lt;= nums.length &lt;= 500</code></li>
 	<li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
 	<li><code>-10<sup>4</sup> &lt;= target &lt;= 10<sup>4</sup></code></li>
 </ul>

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

@@ -11,7 +11,7 @@
 <p>The test cases are generated such that the number of unique combinations that sum up to <code>target</code> is less than <code>150</code> combinations for the given input.</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong>Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2,3,6,7], target = 7
@@ -22,14 +22,14 @@
 These are the only two combinations.
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2,3,5], target = 8
 <strong>Output:</strong> [[2,2,2,2],[2,3,3],[3,5]]
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong>Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2], target = 1
@@ -43,7 +43,7 @@ These are the only two combinations.
 	<li><code>1 &lt;= candidates.length &lt;= 30</code></li>
 	<li><code>2 &lt;= candidates[i] &lt;= 40</code></li>
 	<li>All elements of <code>candidates</code> are <strong>distinct</strong>.</li>
-	<li><code>1 &lt;= target &lt;= 500</code></li>
+	<li><code>1 &lt;= target &lt;= 40</code></li>
 </ul>
 
 ## Solutions

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

@@ -14,7 +14,7 @@
     <li>Words are separated by one or more whitespace characters.</li>
 </ul>
 
-<p><strong>Example:</strong></p>
+<p><strong class="example">Example:</strong></p>
 
 <p>Assume that <code>words.txt</code> has the following content:</p>
 

solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README_EN.md

@@ -9,23 +9,23 @@
 <p>According to the <a href="https://en.wikipedia.org/wiki/Lowest_common_ancestor" target="_blank">definition of LCA on Wikipedia</a>: &ldquo;The lowest common ancestor is defined between two nodes <code>p</code> and <code>q</code> as the lowest node in <code>T</code> that has both <code>p</code> and <code>q</code> as descendants (where we allow <b>a node to be a descendant of itself</b>).&rdquo;</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong>Example 1:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/images/binarytree.png" style="width: 200px; height: 190px;" />
 <pre>
 <strong>Input:</strong> root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> The LCA of nodes 5 and 1 is 3.
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Example 2:</strong></p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/images/binarytree.png" style="width: 200px; height: 190px;" />
 <pre>
 <strong>Input:</strong> root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
 <strong>Output:</strong> 5
 <strong>Explanation:</strong> The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong>Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> root = [1,2], p = 1, q = 2

solution/0300-0399/0306.Additive Number/README_EN.md

@@ -13,7 +13,7 @@
 <p><strong>Note:</strong> Numbers in the additive sequence <strong>cannot</strong> have leading zeros, so sequence <code>1, 2, 03</code> or <code>1, 02, 3</code> is invalid.</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong>Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> &quot;112358&quot;
@@ -23,7 +23,7 @@ The digits can form an additive sequence: 1, 1, 2, 3, 5, 8.
 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> &quot;199100199&quot;

solution/0300-0399/0320.Generalized Abbreviation/README_EN.md

@@ -26,10 +26,10 @@
 <p>Given a string <code>word</code>, return <em>a list of all the possible <strong>generalized abbreviations</strong> of</em> <code>word</code>. Return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 <pre><strong>Input:</strong> word = "word"
 <strong>Output:</strong> ["4","3d","2r1","2rd","1o2","1o1d","1or1","1ord","w3","w2d","w1r1","w1rd","wo2","wo1d","wor1","word"]
-</pre><p><strong>Example 2:</strong></p>
+</pre><p><strong class="example">Example 2:</strong></p>
 <pre><strong>Input:</strong> word = "a"
 <strong>Output:</strong> ["1","a"]
 </pre>

solution/0300-0399/0334.Increasing Triplet Subsequence/README_EN.md

@@ -7,23 +7,23 @@
 <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i &lt; j &lt; k</code><em> and </em><code>nums[i] &lt; nums[j] &lt; nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong>Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3,4,5]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> Any triplet where i &lt; j &lt; k is valid.
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [5,4,3,2,1]
 <strong>Output:</strong> false
 <strong>Explanation:</strong> No triplet exists.
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong>Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [2,1,5,0,4,6]

solution/0600-0699/0679.24 Game/README_EN.md

@@ -29,15 +29,15 @@
 <p>Return <code>true</code> if you can get such expression that evaluates to <code>24</code>, and <code>false</code> otherwise.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> cards = [4,1,8,7]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> (8-4) * (7-1) = 24
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> cards = [1,2,1,2]

solution/0600-0699/0682.Baseball Game/README_EN.md

@@ -36,7 +36,7 @@
 <p>The test cases are generated such that the answer and all intermediate calculations fit in a <strong>32-bit</strong> integer and that all operations are valid.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> ops = [&quot;5&quot;,&quot;2&quot;,&quot;C&quot;,&quot;D&quot;,&quot;+&quot;]
@@ -50,7 +50,7 @@
 The total sum is 5 + 10 + 15 = 30.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> ops = [&quot;5&quot;,&quot;-2&quot;,&quot;4&quot;,&quot;C&quot;,&quot;D&quot;,&quot;9&quot;,&quot;+&quot;,&quot;+&quot;]
@@ -67,7 +67,7 @@ The total sum is 5 + 10 + 15 = 30.
 The total sum is 5 + -2 + -4 + 9 + 5 + 14 = 27.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> ops = [&quot;1&quot;,&quot;C&quot;]

solution/0700-0799/0724.Find Pivot Index/README_EN.md

@@ -10,10 +10,10 @@
 
 <p>If the index is on the left edge of the array, then the left sum is <code>0</code> because there are no elements to the left. This also applies to the right edge of the array.</p>
 
-<p>Return <em>the <strong>leftmost pivot index</strong></em>. If no such index exists, return -1.</p>
+<p>Return <em>the <strong>leftmost pivot index</strong></em>. If no such index exists, return <code>-1</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong>Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,7,3,6,5,6]
@@ -24,15 +24,15 @@ Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11
 Right sum = nums[4] + nums[5] = 5 + 6 = 11
 </pre>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3]
 <strong>Output:</strong> -1
 <strong>Explanation:</strong>
 There is no index that satisfies the conditions in the problem statement.</pre>
 
-<p><strong class="example">Example 3:</strong></p>
+<p><strong>Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [2,1,-1]