style: format python code

* black -S .

Author: yanglbme

lcci/17.13.Re-Space/Solution.py

@@ -6,6 +6,6 @@ def respace(self, dictionary: List[str], sentence: str) -> int:
         for i in range(1, n + 1):
             dp[i] = dp[i - 1] + 1
             for j in range(i):
-                if sentence[j: i] in s:
+                if sentence[j:i] in s:
                     dp[i] = min(dp[i], dp[j])
         return dp[-1]

lcci/17.15.Longest Word/Solution.py

@@ -30,7 +30,9 @@ def cmp(a, b):
             return -1 if a > b else 1
 
         def dfs(w):
-            return not w or any(trie.search(w[:i]) and dfs(w[i:]) for i in range(1, len(w) + 1))
+            return not w or any(
+                trie.search(w[:i]) and dfs(w[i:]) for i in range(1, len(w) + 1)
+            )
 
         words.sort(key=cmp_to_key(cmp))
         trie = Trie()

lcof2/剑指 Offer II 041. 滑动窗口的平均值/Solution.py

@@ -1,5 +1,4 @@
 class MovingAverage:
-
     def __init__(self, size: int):
         self.arr = [0] * size
         self.s = 0

solution/0300-0399/0346.Moving Average from Data Stream/Solution.py

@@ -1,5 +1,4 @@
 class MovingAverage:
-
     def __init__(self, size: int):
         self.arr = [0] * size
         self.s = 0

solution/0400-0499/0472.Concatenated Words/Solution.py

@@ -24,7 +24,7 @@ def dfs(w):
                 if node.children[idx] is None:
                     return False
                 node = node.children[idx]
-                if node.is_end and dfs(w[i + 1:]):
+                if node.is_end and dfs(w[i + 1 :]):
                     return True
             return False
 

solution/0500-0599/0588.Design In-Memory File System/Solution.py

@@ -30,7 +30,6 @@ def search(self, path):
 
 
 class FileSystem:
-
     def __init__(self):
         self.root = Trie()
 

solution/0600-0699/0642.Design Search Autocomplete System/Solution.py

@@ -25,7 +25,6 @@ def search(self, pref):
 
 
 class AutocompleteSystem:
-
     def __init__(self, sentences: List[str], times: List[int]):
         self.trie = Trie()
         for a, b in zip(sentences, times):

solution/0700-0799/0745.Prefix and Suffix Search/Solution.py

@@ -2,7 +2,7 @@ class Trie:
     def __init__(self):
         self.children = [None] * 26
         self.indexes = []
-    
+
     def insert(self, word, i):
         node = self
         for c in word:
@@ -11,7 +11,7 @@ def insert(self, word, i):
                 node.children[idx] = Trie()
             node = node.children[idx]
             node.indexes.append(i)
-    
+
     def search(self, pref):
         node = self
         for c in pref:
@@ -23,7 +23,6 @@ def search(self, pref):
 
 
 class WordFilter:
-
     def __init__(self, words: List[str]):
         self.p = Trie()
         self.s = Trie()
@@ -49,4 +48,4 @@ def f(self, pref: str, suff: str) -> int:
 
 # Your WordFilter object will be instantiated and called as such:
 # obj = WordFilter(words)
-# param_1 = obj.f(pref,suff)
+# param_1 = obj.f(pref,suff)

solution/1100-1199/1166.Design File System/Solution.py

@@ -27,7 +27,6 @@ def search(self, w):
 
 
 class FileSystem:
-
     def __init__(self):
         self.trie = Trie()
 

solution/1200-1299/1268.Search Suggestions System/Solution.py

@@ -25,7 +25,9 @@ def search(self, word):
 
 
 class Solution:
-    def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
+    def suggestedProducts(
+        self, products: List[str], searchWord: str
+    ) -> List[List[str]]:
         products.sort()
         trie = Trie()
         for i, w in enumerate(products):

solution/1600-1699/1698.Number of Distinct Substrings in a String/Solution.py

@@ -1,4 +1,4 @@
 class Solution:
     def countDistinct(self, s: str) -> int:
         n = len(s)
-        return len({s[i: j] for i in range(n) for j in range(i + 1, n + 1)})
+        return len({s[i:j] for i in range(n) for j in range(i + 1, n + 1)})

solution/2200-2299/2227.Encrypt and Decrypt Strings/Solution.py

@@ -1,5 +1,4 @@
 class Encrypter:
-
     def __init__(self, keys: List[str], values: List[str], dictionary: List[str]):
         self.mp = dict(zip(keys, values))
         self.cnt = Counter(self.encrypt(v) for v in dictionary)

solution/2300-2399/2343.Query Kth Smallest Trimmed Number/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def smallestTrimmedNumbers(self, nums: List[str], queries: List[List[int]]) -> List[int]:
+    def smallestTrimmedNumbers(
+        self, nums: List[str], queries: List[List[int]]
+    ) -> List[int]:
         ans = []
         for k, t in queries:
             x = nums[:]