style: format code using prettier and black

* prettier --write "**/*.md"
* black -S .

Author: yanglbme

lcci/02.05.Sum Lists/Solution.py

@@ -4,6 +4,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
         dummy = cur = ListNode(0)

lcci/10.10.Rank from Stream/Solution.py

@@ -21,7 +21,6 @@ def query(self, x):
 
 
 class StreamRank:
-
     def __init__(self):
         self.tree = BinaryIndexedTree(50010)
 

lcs/LCS 03. 主题空间/Solution.py

@@ -16,7 +16,17 @@ def find(x):
                 else:
                     for a, b in dirs:
                         x, y = i + a, j + b
-                        if (grid[x][y] == '0' or grid[i][j] == grid[x][y]) and find(x * n + y) != find(i * n + j):
+                        if (grid[x][y] == '0' or grid[i][j] == grid[x][y]) and find(
+                            x * n + y
+                        ) != find(i * n + j):
                             size[find(x * n + y)] += size[find(i * n + j)]
                             p[find(i * n + j)] = find(x * n + y)
-        return max([size[i * n + j] for i in range(m) for j in range(n) if find(i * n + j) != find(m * n)], default=0)
+        return max(
+            [
+                size[i * n + j]
+                for i in range(m)
+                for j in range(n)
+                if find(i * n + j) != find(m * n)
+            ],
+            default=0,
+        )

solution/0000-0099/0079.Word Search/Solution.py

@@ -3,7 +3,14 @@ def exist(self, board: List[List[str]], word: str) -> bool:
         def dfs(i, j, cur):
             if cur == len(word):
                 return True
-            if i < 0 or i >= m or j < 0 or j >= n or board[i][j] == '0' or word[cur] != board[i][j]:
+            if (
+                i < 0
+                or i >= m
+                or j < 0
+                or j >= n
+                or board[i][j] == '0'
+                or word[cur] != board[i][j]
+            ):
                 return False
             t = board[i][j]
             board[i][j] = '0'

solution/0000-0099/0090.Subsets II/Solution.py

@@ -8,7 +8,7 @@ def dfs(u, t):
                 t.append(nums[i])
                 dfs(i + 1, t)
                 t.pop()
-        
+
         ans = []
         nums.sort()
         dfs(0, [])

solution/0100-0199/0126.Word Ladder II/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def findLadders(self, beginWord: str, endWord: str, wordList: List[str]) -> List[List[str]]:
+    def findLadders(
+        self, beginWord: str, endWord: str, wordList: List[str]
+    ) -> List[List[str]]:
         def dfs(path, cur):
             if cur == beginWord:
                 ans.append(path[::-1])

solution/0100-0199/0127.Word Ladder/Solution.py

@@ -25,8 +25,7 @@ def extend(m1, m2, q):
         q1, q2 = deque([beginWord]), deque([endWord])
         m1, m2 = {beginWord: 0}, {endWord: 0}
         while q1 and q2:
-            t = extend(m1, m2, q1) if len(q1) <= len(
-                q2) else extend(m2, m1, q2)
+            t = extend(m1, m2, q1) if len(q1) <= len(q2) else extend(m2, m1, q2)
             if t != -1:
                 return t + 1
         return 0

solution/0100-0199/0130.Surrounded Regions/Solution.py

@@ -3,6 +3,7 @@ def solve(self, board: List[List[str]]) -> None:
         """
         Do not return anything, modify board in-place instead.
         """
+
         def dfs(i, j):
             board[i][j] = '.'
             for a, b in [[0, -1], [0, 1], [1, 0], [-1, 0]]:
@@ -13,7 +14,9 @@ def dfs(i, j):
         m, n = len(board), len(board[0])
         for i in range(m):
             for j in range(n):
-                if board[i][j] == 'O' and (i == 0 or i == m - 1 or j == 0 or j == n - 1):
+                if board[i][j] == 'O' and (
+                    i == 0 or i == m - 1 or j == 0 or j == n - 1
+                ):
                     dfs(i, j)
         for i in range(m):
             for j in range(n):

solution/0300-0399/0307.Range Sum Query - Mutable/Solution.py

@@ -21,7 +21,6 @@ def query(self, x):
 
 
 class NumArray:
-
     def __init__(self, nums: List[int]):
         self.tree = BinaryIndexedTree(len(nums))
         for i, v in enumerate(nums, 1):

solution/0300-0399/0308.Range Sum Query 2D - Mutable/Solution.py

@@ -21,7 +21,6 @@ def query(self, x):
 
 
 class NumMatrix:
-
     def __init__(self, matrix: List[List[int]]):
         self.trees = []
         n = len(matrix[0])
@@ -37,7 +36,10 @@ def update(self, row: int, col: int, val: int) -> None:
         tree.update(col + 1, val - prev)
 
     def sumRegion(self, row1: int, col1: int, row2: int, col2: int) -> int:
-        return sum(tree.query(col2 + 1) - tree.query(col1) for tree in self.trees[row1: row2 + 1])
+        return sum(
+            tree.query(col2 + 1) - tree.query(col1)
+            for tree in self.trees[row1 : row2 + 1]
+        )
 
 
 # Your NumMatrix object will be instantiated and called as such: