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**