feat: add solutions to lc problem: No.2464

No.2464.Minimum Subarrays in a Valid Split

Author: yanglbme

solution/0100-0199/0152.Maximum Product Subarray/README_EN.md

@@ -4,12 +4,10 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code>, find a contiguous non-empty subarray within the array that has the largest product, and return <em>the product</em>.</p>
+<p>Given an integer array <code>nums</code>, find a <span data-keyword="subarray-nonempty">subarray</span> that has the largest product, and return <em>the product</em>.</p>
 
 <p>The test cases are generated so that the answer will fit in a <strong>32-bit</strong> integer.</p>
 
-<p>A <strong>subarray</strong> is a contiguous subsequence of the array.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, return <em>the length of the longest substring that contains at most <strong>two distinct characters</strong></em>.</p>
+<p>Given a string <code>s</code>, return <em>the length of the longest </em><span data-keyword="substring-nonempty"><em>substring</em></span><em> that contains at most <strong>two distinct characters</strong></em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

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

@@ -4,47 +4,39 @@
 
 ## Description
 
-<p>Write a bash script to calculate the frequency of each word in a text file <code>words.txt</code>.</p>
+<p>Write a bash script to calculate the <span data-keyword="frequency-textfile">frequency</span> of each word in a text file <code>words.txt</code>.</p>
 
 <p>For simplicity sake, you may assume:</p>
 
 <ul>
-    <li><code>words.txt</code> contains only lowercase characters and space <code>&#39; &#39;</code> characters.</li>
-    <li>Each word must consist of lowercase characters only.</li>
-    <li>Words are separated by one or more whitespace characters.</li>
+	<li><code>words.txt</code> contains only lowercase characters and space <code>&#39; &#39;</code> characters.</li>
+	<li>Each word must consist of lowercase characters only.</li>
+	<li>Words are separated by one or more whitespace characters.</li>
 </ul>
 
 <p><strong class="example">Example:</strong></p>
 
 <p>Assume that <code>words.txt</code> has the following content:</p>
 
 <pre>
-
 the day is sunny the the
-
 the sunny is is
-
 </pre>
 
 <p>Your script should output the following, sorted by descending frequency:</p>
 
 <pre>
-
 the 4
-
 is 3
-
 sunny 2
-
 day 1
-
 </pre>
 
 <p><b>Note:</b></p>
 
 <ul>
-    <li>Don&#39;t worry about handling ties, it is guaranteed that each word&#39;s frequency count is unique.</li>
-    <li>Could you write it in one-line using <a href="http://tldp.org/HOWTO/Bash-Prog-Intro-HOWTO-4.html">Unix pipes</a>?</li>
+	<li>Don&#39;t worry about handling ties, it is guaranteed that each word&#39;s frequency count is unique.</li>
+	<li>Could you write it in one-line using <a href="http://tldp.org/HOWTO/Bash-Prog-Intro-HOWTO-4.html">Unix pipes</a>?</li>
 </ul>
 
 ## Solutions

solution/0200-0299/0209.Minimum Size Subarray Sum/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return the minimal length of a <strong>contiguous subarray</strong> <code>[nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub>]</code> of which the sum is greater than or equal to <code>target</code>. If there is no such subarray, return <code>0</code> instead.</p>
+<p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, return <code>0</code> instead.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0200-0299/0214.Shortest Palindrome/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>You are given a string <code>s</code>. You can convert <code>s</code> to a palindrome by adding characters in front of it.</p>
+<p>You are given a string <code>s</code>. You can convert <code>s</code> to a <span data-keyword="palindrome-string">palindrome</span> by adding characters in front of it.</p>
 
 <p>Return <em>the shortest palindrome you can find by performing this transformation</em>.</p>
 

solution/0200-0299/0234.Palindrome Linked List/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given the <code>head</code> of a singly linked list, return <code>true</code><em> if it is a palindrome or </em><code>false</code><em> otherwise</em>.</p>
+<p>Given the <code>head</code> of a singly linked list, return <code>true</code><em> if it is a </em><span data-keyword="palindrome-sequence"><em>palindrome</em></span><em> or </em><code>false</code><em> otherwise</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given the <code>root</code> of a binary tree, return the number of <strong>uni-value</strong> subtrees.</p>
+<p>Given the <code>root</code> of a binary tree, return <em>the number of <strong>uni-value</strong> </em><span data-keyword="subtree"><em>subtrees</em></span>.</p>
 
 <p>A <strong>uni-value subtree</strong> means all nodes of the subtree have the same value.</p>
 

solution/0200-0299/0266.Palindrome Permutation/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, return <code>true</code> if a permutation of the string could form a palindrome.</p>
+<p>Given a string <code>s</code>, return <code>true</code> <em>if a permutation of the string could form a </em><span data-keyword="palindrome-string"><em><strong>palindrome</strong></em></span><em> and </em><code>false</code><em> otherwise</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0200-0299/0269.Alien Dictionary/README_EN.md

@@ -6,11 +6,9 @@
 
 <p>There is a new alien language that uses the English alphabet. However, the order among the letters is unknown to you.</p>
 
-<p>You are given a list of strings <code>words</code> from the alien language&#39;s dictionary, where the strings in <code>words</code> are <strong>sorted lexicographically</strong> by the rules of this new language.</p>
+<p>You are given a list of strings <code>words</code> from the alien language&#39;s dictionary, where the strings in <code>words</code> are <span data-keyword="lexicographically-smaller-string-alien"><strong>sorted lexicographically</strong></span> by the rules of this new language.</p>
 
-<p>Return <em>a string of the unique letters in the new alien language sorted in <strong>lexicographically increasing order</strong> by the new language&#39;s rules. If there is no solution, return </em><code>&quot;&quot;</code><em>. If there are multiple solutions, return <strong>any of them</strong></em>.</p>
-
-<p>A string <code>s</code> is <strong>lexicographically smaller</strong> than a string <code>t</code> if at the first letter where they differ, the letter in <code>s</code> comes before the letter in <code>t</code> in the alien language. If the first <code>min(s.length, t.length)</code> letters are the same, then <code>s</code> is smaller if and only if <code>s.length &lt; t.length</code>.</p>
+<p>Return <em>a string of the unique letters in the new alien language sorted in <strong>lexicographically increasing order</strong> by the new language&#39;s rules. </em>If there is no solution, return <code>&quot;&quot;</code><em>. </em>If there are multiple solutions, return<em> <strong>any of them</strong></em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md

@@ -4,9 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code>, return the length of the longest strictly increasing subsequence.</p>
-
-<p>A <strong>subsequence</strong> is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, <code>[3,6,2,7]</code> is a subsequence of the array <code>[0,3,1,6,2,2,7]</code>.</p>
+<p>Given an integer array <code>nums</code>, return <em>the length of the longest <strong>strictly increasing </strong></em><span data-keyword="subsequence-array"><em><strong>subsequence</strong></em></span>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0316.Remove Duplicate Letters/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, remove duplicate letters so that every letter appears once and only once. You must make sure your result is <strong>the smallest in lexicographical order</strong> among all possible results.</p>
+<p>Given a string <code>s</code>, remove duplicate letters so that every letter appears once and only once. You must make sure your result is <span data-keyword="lexicographically-smaller-string"><strong>the smallest in lexicographical order</strong></span> among all possible results.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

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

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>A word&#39;s <strong>generalized abbreviation</strong> can be constructed by taking any number of <strong>non-overlapping</strong> and <strong>non-adjacent</strong> substrings and replacing them with their respective lengths.</p>
+<p>A word&#39;s <strong>generalized abbreviation</strong> can be constructed by taking any number of <strong>non-overlapping</strong> and <strong>non-adjacent</strong> <span data-keyword="substring-nonempty">substrings</span> and replacing them with their respective lengths.</p>
 
 <ul>
 	<li>For example, <code>&quot;abcde&quot;</code> can be abbreviated into:
@@ -21,6 +21,7 @@
     	<li><code>&quot;22de&quot;</code> (<code>&quot;ab&quot;</code> turned into <code>&quot;2&quot;</code> and <code>&quot;bc&quot;</code> turned into <code>&quot;2&quot;</code>) is invalid as the substring chosen overlap.</li>
     </ul>
     </li>
+
 </ul>
 
 <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>

solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the maximum length of a subarray that sums to</em> <code>k</code>. If there is not one, return <code>0</code> instead.</p>
+<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the maximum length of a </em><span data-keyword="subarray"><em>subarray</em></span><em> that sums to</em> <code>k</code>. If there is not one, return <code>0</code> instead.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0333.Largest BST Subtree/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given the root of a binary tree, find the largest subtree, which is also a Binary Search Tree (BST), where the largest means subtree has the largest number of nodes.</p>
+<p>Given the root of a binary tree, find the largest <span data-keyword="subtree">subtree</span>, which is also a Binary Search Tree (BST), where the largest means subtree has the largest number of nodes.</p>
 
 <p>A <strong>Binary Search Tree (BST)</strong> is a tree in which all the nodes follow the below-mentioned properties:</p>
 

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

@@ -32,6 +32,8 @@
 <strong>输出：</strong>[[0,1],[1,0]]
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

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

@@ -11,7 +11,7 @@
 <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>
+	<li><code>words[i] + words[j]</code> (the concatenation of the two strings) is a <span data-keyword="palindrome-string">palindrome</span>.</li>
 </ul>
 
 <p>Return <em>an array of all the <strong>palindrome pairs</strong> of </em><code>words</code>.</p>

solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code> and an integer <code>k</code>, return <em>the length of the longest substring of</em> <code>s</code> <em>that contains at most</em> <code>k</code> <em><strong>distinct</strong> characters</em>.</p>
+<p>Given a string <code>s</code> and an integer <code>k</code>, return <em>the length of the longest </em><span data-keyword="substring-nonempty"><em>substring</em></span><em> of</em> <code>s</code> <em>that contains at most</em> <code>k</code> <em><strong>distinct</strong> characters</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0500-0599/0554.Brick Wall/README.md

@@ -28,6 +28,8 @@
 <strong>输出：</strong>3
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

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/0830.Positions of Large Groups/README.md

@@ -48,6 +48,8 @@
 <strong>输出：</strong>[]
 </pre>
 
+
+
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0800-0899/0864.Shortest Path to Get All Keys/README.md

@@ -75,10 +75,12 @@
 
 然后，我们可以使用广度优先搜索 $BFS$ 来解决本题。由于钥匙的个数范围是 $[1, 6]$，我们可以用一个二进制数来表示钥匙的状态，其中第 $i$ 位为 $1$ 表示第 $i$ 把钥匙已经获取到了，为 $0$ 表示第 $i$ 把钥匙还没有获取到。
 
-比如，以下例子中，共有 $4$ 个位为 $1$，也就表示共有 $4$ 把钥匙已经获取到了。
+比如，以下例子中，共有 $4$ 个二进制位为 $1$，也就表示有 `'b', 'c', 'd', 'f'` $4$ 把钥匙已经获取到了。
 
 ```
 1 0 1 1 1 0
+^   ^ ^ ^
+f   d c b
 ```
 
 我们定义一个队列 $q$ 来存储当前位置以及当前拥有的钥匙的状态，即 $(i, j, state)$，其中 $(i, j)$ 表示当前位置，$state$ 表示当前拥有的钥匙的状态，即 $state$ 的第 $i$ 位为 $1$ 表示当前拥有第 $i$ 把钥匙，否则表示当前没有第 $i$ 把钥匙。

solution/0800-0899/0864.Shortest Path to Get All Keys/README_EN.md

@@ -159,7 +159,7 @@ class Solution {
 class Solution {
 public:
     const static inline vector<int> dirs = {-1, 0, 1, 0, -1};
-    
+
     int shortestPathAllKeys(vector<string>& grid) {
         int m = grid.size(), n = grid[0].size();
         int k = 0;

solution/1000-1099/1081.Smallest Subsequence of Distinct Characters/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, return <em>the lexicographically smallest subsequence of</em> <code>s</code> <em>that contains all the distinct characters of</em> <code>s</code> <em>exactly once</em>.</p>
+<p>Given a string <code>s</code>, return <em>the </em><span data-keyword="lexicographically-smaller-string"><em>lexicographically smallest</em></span> <span data-keyword="subsequence-string"><em>subsequence</em></span><em> of</em> <code>s</code> <em>that contains all the distinct characters of</em> <code>s</code> <em>exactly once</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1600-1699/1681.Minimum Incompatibility/README.md

@@ -58,8 +58,6 @@
 
 **方法一：状态压缩 + 记忆化搜索**
 
-
-
 <!-- tabs:start -->
 
 ### **Python3**

solution/1600-1699/1684.Count the Number of Consistent Strings/README_EN.md

@@ -62,7 +62,7 @@ class Solution:
     def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
         def f(w):
             return reduce(or_, (1 << (ord(c) - ord('a')) for c in w))
-        
+
         mask = f(allowed)
         return sum((mask | f(w)) == mask for w in words)
 ```