style: format python code

Author: yanglbme

lcp/LCP 07. 传递信息/Solution.py

@@ -6,4 +6,3 @@ def numWays(self, n: int, relation: List[List[int]], k: int) -> int:
             for a, b in relation:
                 dp[i][b] += dp[i - 1][a]
         return dp[-1][-1]
-    

lcp/LCP 08. 剧情触发时间/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def getTriggerTime(self, increase: List[List[int]], requirements: List[List[int]]) -> List[int]:
+    def getTriggerTime(
+        self, increase: List[List[int]], requirements: List[List[int]]
+    ) -> List[int]:
         increase.insert(0, [0, 0, 0])
         m, n = len(increase), len(requirements)
         for i in range(1, m):

lcp/LCP 11. 期望个数统计/Solution.py

@@ -1,3 +1,3 @@
 class Solution:
-   def expectNumber(self, scores: List[int]) -> int:
+    def expectNumber(self, scores: List[int]) -> int:
         return len(set(scores))

lcp/LCP 34. 二叉树染色/Solution.py

@@ -5,6 +5,7 @@
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def maxValue(self, root: TreeNode, k: int) -> int:
         def dfs(root):
@@ -19,5 +20,5 @@ def dfs(root):
                 for j in range(k + 1):
                     ans[0] = max(ans[0], l[i] + r[j])
             return ans
-        
+
         return max(dfs(root))

solution/0400-0499/0497.Random Point in Non-overlapping Rectangles/Solution.py

@@ -1,5 +1,4 @@
 class Solution:
-
     def __init__(self, rects: List[List[int]]):
         self.rects = rects
         self.s = [0] * len(rects)

solution/1000-1099/1052.Grumpy Bookstore Owner/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def maxSatisfied(self, customers: List[int], grumpy: List[int], minutes: int) -> int:
+    def maxSatisfied(
+        self, customers: List[int], grumpy: List[int], minutes: int
+    ) -> int:
         s = sum(a * b for a, b in zip(customers, grumpy))
         cs = sum(customers)
         t = ans = 0

solution/2200-2299/2250.Count Number of Rectangles Containing Each Point/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def countRectangles(self, rectangles: List[List[int]], points: List[List[int]]) -> List[int]:
+    def countRectangles(
+        self, rectangles: List[List[int]], points: List[List[int]]
+    ) -> List[int]:
         d = defaultdict(list)
         for x, y in rectangles:
             d[y].append(x)

solution/2200-2299/2293.Min Max Game/Solution.py

@@ -5,7 +5,10 @@ def minMaxGame(self, nums: List[int]) -> int:
             return nums[0]
         t = []
         for i in range(n >> 1):
-            v = max(nums[i << 1], nums[i << 1 | 1]) if i & 1 else min(
-                nums[i << 1], nums[i << 1 | 1])
+            v = (
+                max(nums[i << 1], nums[i << 1 | 1])
+                if i & 1
+                else min(nums[i << 1], nums[i << 1 | 1])
+            )
             t.append(v)
         return self.minMaxGame(t)

solution/2300-2399/2300.Successful Pairs of Spells and Potions/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def successfulPairs(self, spells: List[int], potions: List[int], success: int) -> List[int]:
+    def successfulPairs(
+        self, spells: List[int], potions: List[int], success: int
+    ) -> List[int]:
         potions.sort()
         m = len(potions)
         ans = []