style: format all python code

Author: yanglbme

.prettierignore

@@ -0,0 +1,15 @@
+.idea/
+.github/
+node_modules/
+/solution/CONTEST_README.md
+/solution/CONTEST_README_EN.md
+/solution/summary.md
+/solution/summary_en.md
+/solution/README.md
+/solution/README_EN.md
+/solution/readme_template.md
+/solution/readme_template_en.md
+/solution/problem_readme_template.md
+/solution/problem_readme_template_en.md
+/solution/bash_problem_readme_template.md
+/solution/bash_problem_readme_template_en.md

basic/sorting/InsertionSort/README.md

@@ -198,13 +198,16 @@ def insertion_sort(array):
     for i in range(len(array)):
         cur_index = i
         while array[cur_index - 1] > array[cur_index] and cur_index - 1 >= 0:
-            array[cur_index], array[cur_index - 1] = array[cur_index - 1], array[cur_index]
+            array[cur_index], array[cur_index - 1] = (
+                array[cur_index - 1],
+                array[cur_index],
+            )
             cur_index -= 1
     return array
 
+
 array = [10, 17, 50, 7, 30, 24, 27, 45, 15, 5, 36, 21]
 print(insertion_sort(array))
-
 ```
 
 <!-- tabs:end -->

basic/sorting/SelectionSort/README.md

@@ -201,17 +201,17 @@ public class Program
 ```python
 def selection_sort(arr):
     n = len(arr)
-    for i in range(n-1):
+    for i in range(n - 1):
         min_index = i
-        for j in range(i+1, n):
+        for j in range(i + 1, n):
             if arr[j] < arr[min_index]:
                 min_index = j
         arr[min_index], arr[i] = arr[i], arr[min_index]
 
+
 arr = [26, 11, 99, 33, 69, 77, 55, 56, 67]
 selection_sort(arr)
 print(arr)
-
 ```
 
 <!-- tabs:end -->

lcci/01.01.Is Unique/README.md

@@ -47,7 +47,7 @@ class Solution:
             pos = ord(c) - ord('a')
             if (bitmap & (1 << pos)) != 0:
                 return False
-            bitmap |= (1 << pos)
+            bitmap |= 1 << pos
         return True
 ```
 

lcci/01.01.Is Unique/README_EN.md

@@ -46,7 +46,7 @@ class Solution:
             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/README.md

@@ -49,10 +49,10 @@ class Solution:
         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))
+        res += S[p] + str(q - p)
         return res if len(res) < len(S) else S
 ```
 

lcci/01.06.Compress String/README_EN.md

@@ -49,10 +49,10 @@ class Solution:
         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))
+        res += S[p] + str(q - p)
         return res if len(res) < len(S) else S
 ```
 

lcci/01.07.Rotate Matrix/README.md

@@ -73,7 +73,6 @@ class Solution:
                 matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1]
                 matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1]
                 matrix[j][n - i - 1] = t
-
 ```
 
 ### **Java**

lcci/01.07.Rotate Matrix/README_EN.md

@@ -96,7 +96,6 @@ class Solution:
                 matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1]
                 matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1]
                 matrix[j][n - i - 1] = t
-
 ```
 
 ### **Java**

lcci/01.08.Zero Matrix/README.md

@@ -78,7 +78,6 @@ class Solution:
                 matrix[i][j] = 0
 
         return matrix
-
 ```
 
 ### **Java**

lcci/01.08.Zero Matrix/README_EN.md

@@ -97,7 +97,6 @@ class Solution:
                 matrix[i][j] = 0
 
         return matrix
-
 ```
 
 ### **Java**

lcci/02.01.Remove Duplicate Node/README.md

@@ -49,6 +49,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def removeDuplicateNodes(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:

lcci/02.01.Remove Duplicate Node/README_EN.md

@@ -51,6 +51,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def removeDuplicateNodes(self, head: ListNode) -> ListNode:
         if head is None or head.next is None:

lcci/02.02.Kth Node From End of List/README.md

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

lcci/02.02.Kth Node From End of List/README_EN.md

@@ -33,6 +33,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/README.md

@@ -47,6 +47,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def deleteNode(self, node):
         """

lcci/02.03.Delete Middle Node/README_EN.md

@@ -31,6 +31,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def deleteNode(self, node):
         """

lcci/02.04.Partition List/README.md

@@ -67,6 +67,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.04.Partition List/README_EN.md

@@ -29,6 +29,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/README.md

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

lcci/02.05.Sum Lists/README_EN.md

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

lcci/02.07.Intersection of Two Linked Lists/README.md

@@ -30,6 +30,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
         cur1, cur2 = headA, headB

lcci/02.07.Intersection of Two Linked Lists/README_EN.md

@@ -58,6 +58,7 @@
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
         cur1, cur2 = headA, headB

lcci/02.08.Linked List Cycle/README.md

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

lcci/03.01.Three in One/README.md

@@ -44,7 +44,6 @@
 
 ```python
 class TripleInOne:
-
     def __init__(self, stackSize: int):
         self._capacity = stackSize
         self._s = [[], [], []]

lcci/03.01.Three in One/README_EN.md

@@ -52,7 +52,6 @@
 
 ```python
 class TripleInOne:
-
     def __init__(self, stackSize: int):
         self._capacity = stackSize
         self._s = [[], [], []]

lcci/03.02.Min Stack/README.md

@@ -21,7 +21,6 @@
 
 ```python
 class MinStack:
-
     def __init__(self):
         """
         initialize your data structure here.

lcci/03.02.Min Stack/README_EN.md

@@ -34,7 +34,6 @@ minStack.getMin();   --&gt; return -2.</pre>
 
 ```python
 class MinStack:
-
     def __init__(self):
         """
         initialize your data structure here.

lcci/03.03.Stack of Plates/README.md

@@ -39,6 +39,7 @@
 
 ```python
 
+
 ```
 
 ### **Java**
@@ -47,6 +48,7 @@
 
 ```java
 
+
 ```
 
 ### **TypeScript**
@@ -113,6 +115,7 @@ class StackOfPlates {
 
 ```
 
+
 ```
 
 <!-- tabs:end -->

lcci/03.03.Stack of Plates/README_EN.md

@@ -12,34 +12,47 @@
 
 <pre>
 
+
 <strong> Input</strong>: 
 
+
 [&quot;StackOfPlates&quot;, &quot;push&quot;, &quot;push&quot;, &quot;popAt&quot;, &quot;pop&quot;, &quot;pop&quot;]
 
+
 [[1], [1], [2], [1], [], []]
 
+
 <strong> Output</strong>: 
 
+
 [null, null, null, 2, 1, -1]
 
+
 <strong> Explanation</strong>: 
 
+
 </pre>
 
 <p><strong>Example2:</strong></p>
 
 <pre>
 
+
 <strong> Input</strong>: 
 
+
 [&quot;StackOfPlates&quot;, &quot;push&quot;, &quot;push&quot;, &quot;push&quot;, &quot;popAt&quot;, &quot;popAt&quot;, &quot;popAt&quot;]
 
+
 [[2], [1], [2], [3], [0], [0], [0]]
 
+
 <strong> Output</strong>: 
 
+
 [null, null, null, null, 2, 1, 3]
 
+
 </pre>
 
 ## Solutions
@@ -50,12 +63,14 @@
 
 ```python
 
+
 ```
 
 ### **Java**
 
 ```java
 
+
 ```
 
 ### **TypeScript**
@@ -122,6 +137,7 @@ class StackOfPlates {
 
 ```
 
+
 ```
 
 <!-- tabs:end -->