style: format python code in markdown files (doocs#1040)

Author: yanglbme

Pipfile

@@ -56,13 +56,15 @@ p[find(a)] = find(b)
 p = list(range(n))
 size = [1] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
         # 路径压缩
         p[x] = find(p[x])
     return p[x]
 
+
 # 合并a和b所在的两个集合
 if find(a) != find(b):
     size[find(b)] += size[find(a)]
@@ -76,6 +78,7 @@ if find(a) != find(b):
 p = list(range(n))
 d = [0] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
@@ -84,6 +87,7 @@ def find(x):
         p[x] = t
     return p[x]
 
+
 # 合并a和b所在的两个集合
 p[find(a)] = find(b)
 d[find(a)] = distance

Pipfile.lock

@@ -59,6 +59,7 @@ class Solution:
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def reversePrint(self, head: ListNode) -> List[int]:
         if head is None:

lcci/16.19.Pond Sizes/README.md

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

lcof/面试题06. 从尾到头打印链表/README.md

@@ -72,6 +72,7 @@ class Solution:
 #         self.val = x
 #         self.next = None
 
+
 class Solution:
     def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
         if l1 is None or l2 is None:

lcof/面试题24. 反转链表/README.md

@@ -74,6 +74,7 @@ class Solution:
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def mirrorTree(self, root: TreeNode) -> TreeNode:
         if root is None:

lcof/面试题25. 合并两个排序的链表/README.md

@@ -94,6 +94,7 @@ class BinaryIndexedTree:
             x -= x & -x
         return s
 
+
 class Solution:
     def reversePairs(self, nums: List[int]) -> int:
         alls = sorted(set(nums))

lcof/面试题27. 二叉树的镜像/README.md

@@ -62,6 +62,7 @@ class Solution:
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def maxDepth(self, root: TreeNode) -> int:
         def dfs(root):

lcof/面试题51. 数组中的逆序对/README.md

@@ -84,8 +84,11 @@ class Solution:
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
-    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+    def lowestCommonAncestor(
+        self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode'
+    ) -> 'TreeNode':
         if root.val < p.val and root.val < q.val:
             return self.lowestCommonAncestor(root.right, p, q)
         if root.val > p.val and root.val > q.val:

lcof/面试题55 - I. 二叉树的深度/README.md

@@ -128,7 +128,7 @@ class Solution:
                     if window[ch] == need[ch]:
                         windowCount -= 1
                     window[ch] -= 1
-        return "" if minLen == inf else s[start:start + minLen]
+        return "" if minLen == inf else s[start : start + minLen]
 ```
 
 ### **Java**

lcof/面试题68 - I. 二叉搜索树的最近公共祖先/README.md

@@ -82,7 +82,6 @@ class MovingAverage:
 
 ```python
 class MovingAverage:
-
     def __init__(self, size: int):
         self.n = size
         self.s = 0

lcof2/剑指 Offer II 017. 含有所有字符的最短字符串/README.md

@@ -132,7 +132,6 @@ class BSTIterator:
 #         self.left = left
 #         self.right = right
 class BSTIterator:
-
     def __init__(self, root: TreeNode):
         self.stack = []
         while root:

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

@@ -132,6 +132,7 @@ class Trie:
                 node = node.children[v]
         return res
 
+
 class Solution:
     def findMaximumXOR(self, nums: List[int]) -> int:
         trie = Trie()

lcof2/剑指 Offer II 055. 二叉搜索树迭代器/README.md

@@ -78,13 +78,15 @@ p[find(a)] = find(b)
 p = list(range(n))
 size = [1] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
         # 路径压缩
         p[x] = find(p[x])
     return p[x]
 
+
 # 合并a和b所在的两个集合
 if find(a) != find(b):
     size[find(b)] += size[find(a)]
@@ -98,6 +100,7 @@ if find(a) != find(b):
 p = list(range(n))
 d = [0] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
@@ -106,6 +109,7 @@ def find(x):
         p[x] = t
     return p[x]
 
+
 # 合并a和b所在的两个集合
 p[find(a)] = find(b)
 d[find(a)] = distance
@@ -132,7 +136,10 @@ class Solution:
             return ans
 
         m, n = len(grid), len(grid[0])
-        return max([dfs(i, j) for i in range(m) for j in range(n) if grid[i][j] == 1], default=0)
+        return max(
+            [dfs(i, j) for i in range(m) for j in range(n) if grid[i][j] == 1],
+            default=0,
+        )
 ```
 
 并查集：
@@ -153,10 +160,18 @@ class Solution:
                 if grid[i][j] == 1:
                     for a, b in [[0, 1], [1, 0]]:
                         x, y = i + a, j + b
-                        if 0 <= x < m and 0 <= y < n and grid[x][y] == 1 and find(i * n + j) != find(x * n + y):
+                        if (
+                            0 <= x < m
+                            and 0 <= y < n
+                            and grid[x][y] == 1
+                            and find(i * n + j) != find(x * n + y)
+                        ):
                             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 grid[i][j] == 1], default=0)
+        return max(
+            [size[i * n + j] for i in range(m) for j in range(n) if grid[i][j] == 1],
+            default=0,
+        )
 ```
 
 ### **Java**

lcof2/剑指 Offer II 067. 最大的异或/README.md

@@ -91,13 +91,15 @@ p[find(a)] = find(b)
 p = list(range(n))
 size = [1] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
         # 路径压缩
         p[x] = find(p[x])
     return p[x]
 
+
 # 合并a和b所在的两个集合
 if find(a) != find(b):
     size[find(b)] += size[find(a)]
@@ -111,6 +113,7 @@ if find(a) != find(b):
 p = list(range(n))
 d = [0] * n
 
+
 # 返回x的祖宗节点
 def find(x):
     if p[x] != x:
@@ -119,6 +122,7 @@ def find(x):
         p[x] = t
     return p[x]
 
+
 # 合并a和b所在的两个集合
 p[find(a)] = find(b)
 d[find(a)] = distance