feat: update lc problems

Author: yanglbme

solution/0200-0299/0220.Contains Duplicate III/Solution.py

@@ -2,7 +2,9 @@
 
 
 class Solution:
-    def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:
+    def containsNearbyAlmostDuplicate(
+        self, nums: List[int], indexDiff: int, valueDiff: int
+    ) -> bool:
         s = SortedSet()
         for i, v in enumerate(nums):
             j = s.bisect_left(v - valueDiff)

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/0500-0599/0554.Brick Wall/README.md

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

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

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

solution/0900-0999/0913.Cat and Mouse/Solutioin.py

@@ -43,7 +43,8 @@ def get_prev_states(state):
                 pm, pc, pt = prev_state
                 if res[pm][pc][pt] == TIE:
                     win = (t == MOUSE_WIN and pt == MOUSE_TURN) or (
-                        t == CAT_WIN and pt == CAT_TURN)
+                        t == CAT_WIN and pt == CAT_TURN
+                    )
                     if win:
                         res[pm][pc][pt] = t
                         q.append(prev_state)

solution/1700-1799/1730.Shortest Path to Get Food/Solution.py

@@ -1,8 +1,7 @@
 class Solution:
     def getFood(self, grid: List[List[str]]) -> int:
         m, n = len(grid), len(grid[0])
-        i, j = next((i, j) for i in range(m)
-                    for j in range(n) if grid[i][j] == '*')
+        i, j = next((i, j) for i in range(m) for j in range(n) if grid[i][j] == '*')
         q = deque([(i, j)])
         dirs = (-1, 0, 1, 0, -1)
         ans = 0

solution/2400-2499/2476.Closest Nodes Queries in a Binary Search Tree/Solution.py

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