feat: add solutions to lc problems: No.2404~2407

* No.2404.Most Frequent Even Element
* No.2405.Optimal Partition of String
* No.2406.Divide Intervals Into Minimum Number of Groups
* No.2407.Longest Increasing Subsequence II

Author: yanglbme

lcci/03.03.Stack of Plates/README.md

@@ -23,6 +23,7 @@
 </pre>
 
 ## 解法
+
 <!-- 这里可写通用的实现逻辑 -->
 
 <!-- tabs:start -->
@@ -34,6 +35,7 @@
 ```python
 
 ```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->

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

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

solution/0400-0499/0484.Find Permutation/Solution.py

@@ -7,6 +7,6 @@ def findPermutation(self, s: str) -> List[int]:
             j = i
             while j < n and s[j] == 'D':
                 j += 1
-            ans[i: j + 1] = ans[i: j + 1][::-1]
+            ans[i : j + 1] = ans[i : j + 1][::-1]
             i = max(i + 1, j)
         return ans

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

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

solution/0500-0599/0576.Out of Boundary Paths/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def findPaths(self, m: int, n: int, maxMove: int, startRow: int, startColumn: int) -> int:
+    def findPaths(
+        self, m: int, n: int, maxMove: int, startRow: int, startColumn: int
+    ) -> int:
         @cache
         def dfs(i, j, k):
             if i < 0 or j < 0 or i >= m or j >= n:

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

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

solution/0700-0799/0776.Split BST/Solution.py

@@ -5,7 +5,9 @@
 #         self.left = left
 #         self.right = right
 class Solution:
-    def splitBST(self, root: Optional[TreeNode], target: int) -> List[Optional[TreeNode]]:
+    def splitBST(
+        self, root: Optional[TreeNode], target: int
+    ) -> List[Optional[TreeNode]]:
         def dfs(root):
             if root is None:
                 return [None, None]

solution/0800-0899/0830.Positions of Large Groups/README.md

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

solution/0800-0899/0857.Minimum Cost to Hire K Workers/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def mincostToHireWorkers(self, quality: List[int], wage: List[int], k: int) -> float:
+    def mincostToHireWorkers(
+        self, quality: List[int], wage: List[int], k: int
+    ) -> float:
         t = sorted(zip(quality, wage), key=lambda x: x[1] / x[0])
         ans, tot = inf, 0
         h = []

solution/1000-1099/1032.Stream of Characters/Solution.py

@@ -25,7 +25,6 @@ def search(self, w):
 
 
 class StreamChecker:
-
     def __init__(self, words: List[str]):
         self.trie = Trie()
         self.s = []
@@ -36,6 +35,7 @@ def query(self, letter: str) -> bool:
         self.s.append(letter)
         return self.trie.search(self.s[-201:])
 
+
 # Your StreamChecker object will be instantiated and called as such:
 # obj = StreamChecker(words)
 # param_1 = obj.query(letter)