feat: add new lc problems

Author: yanglbme

solution/0300-0399/0336.Palindrome Pairs/README_EN.md

@@ -4,30 +4,41 @@
 
 ## Description
 
-<p>Given a list of <b>unique</b> words, return all the pairs of the&nbsp;<b><i>distinct</i></b> indices <code>(i, j)</code> in the given list, so that the concatenation of the two words&nbsp;<code>words[i] + words[j]</code> is a palindrome.</p>
+<p>You are given a <strong>0-indexed</strong> array of <strong>unique</strong> strings <code>words</code>.</p>
+
+<p>A <strong>palindrome pair</strong> is a pair of integers <code>(i, j)</code> such that:</p>
+
+<ul>
+	<li><code>0 &lt;= i, j &lt; word.length</code>,</li>
+	<li><code>i != j</code>, and</li>
+	<li><code>words[i] + words[j]</code> (the concatenation of the two strings) is a palindrome string.</li>
+</ul>
+
+<p>Return <em>an array of all the <strong>palindrome pairs</strong> of </em><code>words</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> words = [&quot;abcd&quot;,&quot;dcba&quot;,&quot;lls&quot;,&quot;s&quot;,&quot;sssll&quot;]
 <strong>Output:</strong> [[0,1],[1,0],[3,2],[2,4]]
-<strong>Explanation:</strong> The palindromes are [&quot;dcbaabcd&quot;,&quot;abcddcba&quot;,&quot;slls&quot;,&quot;llssssll&quot;]
+<strong>Explanation:</strong> The palindromes are [&quot;abcddcba&quot;,&quot;dcbaabcd&quot;,&quot;slls&quot;,&quot;llssssll&quot;]
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> words = [&quot;bat&quot;,&quot;tab&quot;,&quot;cat&quot;]
 <strong>Output:</strong> [[0,1],[1,0]]
 <strong>Explanation:</strong> The palindromes are [&quot;battab&quot;,&quot;tabbat&quot;]
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> words = [&quot;a&quot;,&quot;&quot;]
 <strong>Output:</strong> [[0,1],[1,0]]
+<strong>Explanation:</strong> The palindromes are [&quot;a&quot;,&quot;a&quot;]
 </pre>
 
 <p>&nbsp;</p>
@@ -36,7 +47,7 @@
 <ul>
 	<li><code>1 &lt;= words.length &lt;= 5000</code></li>
 	<li><code>0 &lt;= words[i].length &lt;= 300</code></li>
-	<li><code>words[i]</code> consists of lower-case English letters.</li>
+	<li><code>words[i]</code> consists of lowercase English letters.</li>
 </ul>
 
 ## Solutions

solution/0300-0399/0348.Design Tic-Tac-Toe/README_EN.md

@@ -12,11 +12,17 @@
 	<li>A player who succeeds in placing <code>n</code> of their marks in a horizontal, vertical, or diagonal row wins the game.</li>
 </ol>
 
-<p>Implement the&nbsp;<code>TicTacToe</code> class:</p>
+<p>Implement the <code>TicTacToe</code> class:</p>
 
 <ul>
 	<li><code>TicTacToe(int n)</code> Initializes the object the size of the board <code>n</code>.</li>
-	<li><code>int move(int row, int col, int player)</code> Indicates that the player with id <code>player</code> plays at the cell <code>(row, col)</code> of the board. The move is guaranteed to be a valid move.</li>
+	<li><code>int move(int row, int col, int player)</code> Indicates that the player with id <code>player</code> plays at the cell <code>(row, col)</code> of the board. The move is guaranteed to be a valid move, and the two players alternate in making moves. Return
+	<ul>
+		<li><code>0</code> if there is <strong>no winner</strong> after the move,</li>
+		<li><code>1</code> if <strong>player 1</strong> is the winner after the move, or</li>
+		<li><code>2</code> if <strong>player 2</strong> is the winner after the move.</li>
+	</ul>
+	</li>
 </ul>
 
 <p>&nbsp;</p>

solution/0400-0499/0493.Reverse Pairs/README_EN.md

@@ -6,7 +6,12 @@
 
 <p>Given an integer array <code>nums</code>, return <em>the number of <strong>reverse pairs</strong> in the array</em>.</p>
 
-<p>A reverse pair is a pair <code>(i, j)</code> where <code>0 &lt;= i &lt; j &lt; nums.length</code> and <code>nums[i] &gt; 2 * nums[j]</code>.</p>
+<p>A <strong>reverse pair</strong> is a pair <code>(i, j)</code> where:</p>
+
+<ul>
+	<li><code>0 &lt;= i &lt; j &lt; nums.length</code> and</li>
+	<li><code>nums[i] &gt; 2 * nums[j]</code>.</li>
+</ul>
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
@@ -27,7 +32,7 @@
 <strong>Explanation:</strong> The reverse pairs are:
 (1, 4) --&gt; nums[1] = 4, nums[4] = 1, 4 &gt; 2 * 1
 (2, 4) --&gt; nums[2] = 3, nums[4] = 1, 3 &gt; 2 * 1
-(3, 4) --&gt; nums[3] = 3, nums[4] = 1, 5 &gt; 2 * 1
+(3, 4) --&gt; nums[3] = 5, nums[4] = 1, 5 &gt; 2 * 1
 </pre>
 
 <p>&nbsp;</p>

solution/0700-0799/0718.Maximum Length of Repeated Subarray/README_EN.md

@@ -7,19 +7,20 @@
 <p>Given two integer arrays <code>nums1</code> and <code>nums2</code>, return <em>the maximum length of a subarray that appears in <strong>both</strong> arrays</em>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> The repeated subarray with maximum length is [3,2,1].
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums1 = [0,0,0,0,0], nums2 = [0,0,0,0,0]
 <strong>Output:</strong> 5
+<strong>Explanation:</strong> The repeated subarray with maximum length is [0,0,0,0,0].
 </pre>
 
 <p>&nbsp;</p>

solution/0700-0799/0775.Global and Local Inversions/README.md

@@ -42,6 +42,8 @@
 <strong>解释：</strong>有 2 个全局倒置，和 1 个局部倒置。
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0800-0899/0854.K-Similar Strings/README_EN.md

@@ -9,18 +9,20 @@
 <p>Given two anagrams <code>s1</code> and <code>s2</code>, return the smallest <code>k</code> for which <code>s1</code> and <code>s2</code> are <code>k</code><strong>-similar</strong>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;ba&quot;
 <strong>Output:</strong> 1
+<strong>Explanation:</strong> The two string are 1-similar because we can use one swap to change s1 to s2: &quot;ab&quot; --&gt; &quot;ba&quot;.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s1 = &quot;abc&quot;, s2 = &quot;bca&quot;
 <strong>Output:</strong> 2
+<strong>Explanation:</strong> The two strings are 2-similar because we can use two swaps to change s1 to s2: &quot;abc&quot; --&gt; &quot;bac&quot; --&gt; &quot;bca&quot;.
 </pre>
 
 <p>&nbsp;</p>

solution/1000-1099/1012.Numbers With Repeated Digits/README.md

@@ -109,7 +109,7 @@ class Solution:
 class Solution:
     def numDupDigitsAtMostN(self, n: int) -> int:
         return n - self.f(n)
-    
+
     def f(self, n):
         @cache
         def dfs(pos, mask, lead, limit):

solution/1000-1099/1012.Numbers With Repeated Digits/README_EN.md

@@ -77,7 +77,7 @@ class Solution:
 class Solution:
     def numDupDigitsAtMostN(self, n: int) -> int:
         return n - self.f(n)
-    
+
     def f(self, n):
         @cache
         def dfs(pos, mask, lead, limit):

solution/1700-1799/1770.Maximum Score from Performing Multiplication Operations/README_EN.md

@@ -4,14 +4,18 @@
 
 ## Description
 
-<p>You are given two integer arrays <code>nums</code> and <code>multipliers</code><strong> </strong>of size <code>n</code> and <code>m</code> respectively, where <code>n &gt;= m</code>. The arrays are <strong>1-indexed</strong>.</p>
+<p>You are given two <strong>0-indexed</strong> integer arrays <code>nums</code> and <code>multipliers</code><strong> </strong>of size <code>n</code> and <code>m</code> respectively, where <code>n &gt;= m</code>.</p>
 
-<p>You begin with a score of <code>0</code>. You want to perform <strong>exactly</strong> <code>m</code> operations. On the <code>i<sup>th</sup></code> operation <strong>(1-indexed)</strong>, you will:</p>
+<p>You begin with a score of <code>0</code>. You want to perform <strong>exactly</strong> <code>m</code> operations. On the <code>i<sup>th</sup></code> operation (<strong>0-indexed</strong>) you will:</p>
 
 <ul>
-	<li>Choose one integer <code>x</code> from <strong>either the start or the end </strong>of the array <code>nums</code>.</li>
-	<li>Add <code>multipliers[i] * x</code> to your score.</li>
-	<li>Remove <code>x</code> from the array <code>nums</code>.</li>
+    <li>Choose one integer <code>x</code> from <strong>either the start or the end </strong>of the array <code>nums</code>.</li>
+    <li>Add <code>multipliers[i] * x</code> to your score.
+    <ul>
+        <li>Note that <code>multipliers[0]</code> corresponds to the first operation, <code>multipliers[1]</code> to the second operation, and so on.</li>
+    </ul>
+    </li>
+    <li>Remove <code>x</code> from <code>nums</code>.</li>
 </ul>
 
 <p>Return <em>the <strong>maximum</strong> score after performing </em><code>m</code> <em>operations.</em></p>
@@ -48,7 +52,7 @@ The total score is 50 + 15 - 9 + 4 + 42 = 102.
 <ul>
 	<li><code>n == nums.length</code></li>
 	<li><code>m == multipliers.length</code></li>
-	<li><code>1 &lt;= m &lt;= 10<sup>3</sup></code></li>
+	<li><code>1 &lt;= m &lt;= 300</code></li>
 	<li><code>m &lt;= n &lt;= 10<sup>5</sup></code><code> </code></li>
 	<li><code>-1000 &lt;= nums[i], multipliers[i] &lt;= 1000</code></li>
 </ul>

solution/2300-2399/2376.Count Special Integers/README.md

@@ -178,7 +178,7 @@ class Solution {
 class Solution {
     private int[] a = new int[11];
     private int[][] dp = new int[11][1 << 11];
-    
+
     public int countSpecialNumbers(int n) {
         return f(n);
     }