style: reformat python code using black

* black -S .

Author: yanglbme

basic/sorting/MergeSort/Main.py

@@ -23,7 +23,7 @@ def merge_sort(nums, left, right):
     while j <= right:
         tmp.append(nums[j])
         j += 1
-    
+
     j = 0
     for i in range(left, right + 1):
         nums[i] = tmp[j]

lcci/01.01.Is Unique/Solution.py

@@ -5,5 +5,5 @@ def isUnique(self, astr: str) -> bool:
             pos = ord(c) - ord('a')
             if (bitmap & (1 << pos)) != 0:
                 return False
-            bitmap |= (1 << pos)
+            bitmap |= 1 << pos
         return True

lcci/01.06.Compress String/Solution.py

@@ -6,8 +6,8 @@ def compressString(self, S: str) -> str:
         res = ''
         while q < len(S):
             if S[p] != S[q]:
-                res += (S[p] + str(q - p))
+                res += S[p] + str(q - p)
                 p = q
             q += 1
-        res += (S[p] + str(q - p))
-        return res if len(res) < len(S) else S
+        res += S[p] + str(q - p)
+        return res if len(res) < len(S) else S

lcci/01.08.Zero Matrix/Solution.py

@@ -10,13 +10,13 @@ def setZeroes(self, matrix: List[List[int]]) -> None:
                 if matrix[i][j] == 0:
                     zero_rows.add(i)
                     zero_cols.add(j)
-        
+
         for i in zero_rows:
             for j in range(cols):
                 matrix[i][j] = 0
-        
+
         for j in zero_cols:
             for i in range(rows):
                 matrix[i][j] = 0
-        
+
         return matrix

lcci/02.01.Remove Duplicate Node/Solution.py

@@ -4,6 +4,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def removeDuplicateNodes(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:
@@ -18,4 +19,4 @@ def removeDuplicateNodes(self, head: ListNode) -> ListNode:
                 cache.add(p.val)
             p = p.next
         cur.next = None
-        return head
+        return head

lcci/02.02.Kth Node From End of List/Solution.py

@@ -4,6 +4,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def kthToLast(self, head: ListNode, k: int) -> int:
         slow = fast = head

lcci/02.03.Delete Middle Node/Solution.py

@@ -4,11 +4,12 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def deleteNode(self, node):
         """
         :type node: ListNode
         :rtype: void Do not return anything, modify node in-place instead.
         """
         node.val = node.next.val
-        node.next = node.next.next
+        node.next = node.next.next

lcci/02.04.Partition List/Solution.py

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

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:
         carry = 0
@@ -16,4 +17,4 @@ def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
             cur = cur.next
             l1 = None if not l1 else l1.next
             l2 = None if not l2 else l2.next
-        return dummy.next
+        return dummy.next

lcci/02.06.Palindrome Linked List/Solution.py

@@ -19,4 +19,4 @@ def isPalindrome(self, head: ListNode) -> bool:
             if pre.val != head.val:
                 return False
             pre, head = pre.next, head.next
-        return True
+        return True