style: format code and documents

Author: yanglbme

lcof/面试题09. 用两个栈实现队列/README.md

@@ -299,11 +299,11 @@ public class CQueue {
         stack1 = new Stack<int>();
         stack2 = new Stack<int>();
     }
-    
+
     public void AppendTail(int value) {
         stack1.Push(value);
     }
-    
+
     public int DeleteHead() {
         if (stack2.Count == 0) {
             while (stack1.Count != 0) {
@@ -327,4 +327,5 @@ public class CQueue {
 ```
 
 ```
+
 <!-- tabs:end -->

lcof/面试题11. 旋转数组的最小数字/README.md

@@ -175,4 +175,5 @@ public class Solution {
 ```
 
 ```
+
 <!-- tabs:end -->

lcof/面试题12. 矩阵中的路径/README.md

@@ -298,7 +298,7 @@ public class Solution {
             {
                 if (dfs(board, word, i, j, k)) {
                     return true;
-                }   
+                }
             }
         }
         return false;

lcof/面试题19. 正则表达式匹配/README.md

@@ -237,7 +237,7 @@ public class Solution {
         for(int j = 1; j < n + 1; j++) {
             if (p[j-1] == '*') {
                 dp[0,j] = dp[0,j-2];
-            } 
+            }
         }
         for (int i = 1; i < m + 1; i++) {
             for (int j = 1; j < n + 1; j++) {

lcof/面试题26. 树的子结构/README.md

@@ -289,7 +289,7 @@ public class Solution {
             return false;
         }
         return dfs(A, B) || IsSubStructure(A.left, B) || IsSubStructure(A.right, B);
-    } 
+    }
 
     public bool dfs(TreeNode A, TreeNode B) {
         if (B == null) {

lcof/面试题28. 对称的二叉树/README.md

@@ -290,7 +290,7 @@ public class Solution {
         if (left == null || right == null || left.val != right.val) {
             return false;
         }
-        return dfs(left.left, right.right) && dfs(left.right, right.left); 
+        return dfs(left.left, right.right) && dfs(left.right, right.left);
     }
 }
 ```

lcof/面试题29. 顺时针打印矩阵/README.md

@@ -197,7 +197,7 @@ public class Solution {
             }
             for (int i = bottom; i >= top; i--) {
                 ans.Add(matrix[i][left]);
-            } 
+            }
             left += 1;
             if (left > right) {
                 break;

lcof/面试题30. 包含min函数的栈/README.md

@@ -283,21 +283,21 @@ public class MinStack {
         minStack = new Stack<int>();
         minStack.Push(int.MaxValue);
     }
-    
+
     public void Push(int x) {
         stack.Push(x);
         minStack.Push(Math.Min(minStack.Peek(), x));
     }
-    
+
     public void Pop() {
         stack.Pop();
         minStack.Pop();
     }
-    
+
     public int Top() {
         return stack.Peek();
     }
-    
+
     public int Min() {
         return minStack.Peek();
     }

lcof/面试题33. 二叉搜索树的后序遍历序列/README.md

@@ -225,6 +225,7 @@ impl Solution {
 ```
 
 ### **C#**
+
 ```cs
 public class Solution {
     public bool VerifyPostorder(int[] postorder) {

lcof/面试题37. 序列化二叉树/README.md

@@ -323,18 +323,18 @@ public class Codec {
         }
         return str;
     }
-  
+
     public TreeNode rdeserialize(LinkedList<string> dataList) {
         if (dataList.First.Value.Equals("None")) {
             dataList.RemoveFirst();
             return null;
         }
-  
+
         TreeNode root = new TreeNode(int.Parse(dataList.First.Value));
         dataList.RemoveFirst();
         root.left = rdeserialize(dataList);
         root.right = rdeserialize(dataList);
-    
+
         return root;
     }
 }

lcof/面试题41. 数据流中的中位数/README.md

@@ -321,7 +321,7 @@ public class MedianFinder {
         }
         return left;
     }
-    
+
     public void AddNum(int num) {
         if (nums.Count == 0) {
             nums.Add(num);
@@ -335,7 +335,7 @@ public class MedianFinder {
             }
         }
     }
-    
+
     public double FindMedian() {
         if (nums.Count % 2 == 1) {
             return (double)nums[nums.Count / 2];

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

@@ -310,7 +310,7 @@ public class Solution {
         }
         return ans;
     }
-    
+
 }
 ```
 

lcof/面试题53 - I. 在排序数组中查找数字 I/README.md

@@ -256,6 +256,7 @@ public class Solution {
         return i;
     }
 }
+```
 
 ### **...**
 

lcof/面试题54. 二叉搜索树的第k大节点/README.md

@@ -356,7 +356,6 @@ public class Solution {
 }
 ```
 
-
 ### **...**
 
 ```

lcof/面试题56 - I. 数组中数字出现的次数/README.md

@@ -121,7 +121,7 @@ public class Solution {
             }
         }
         int b = eor ^ a;
-        
+
         return new int[]{a, b};
     }
 }

lcof/面试题59 - II. 队列的最大值/README.md

@@ -356,22 +356,22 @@ public class MaxQueue {
         mvq = new LinkedList<int>();
         q = new Queue<int>();
     }
-    
+
     public int Max_value() {
         if (mvq.Count == 0) {
             return -1;
         }
         return mvq.First.Value;
     }
-    
+
     public void Push_back(int value) {
         q.Enqueue(value);
         while (mvq.Count > 0 && mvq.Last.Value < value) {
             mvq.RemoveLast();
         }
         mvq.AddLast(value);
     }
-    
+
     public int Pop_front() {
         if (q.Count == 0) {
             return -1;

lcof/面试题65. 不用加减乘除做加法/README.md

@@ -142,7 +142,7 @@ public class Solution {
             a = a ^ b;
             b = c;
         }
-        
+
         return a;
     }
 }

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

@@ -115,7 +115,7 @@ class MovingAverage {
     public MovingAverage(int size) {
         arr = new int[size];
     }
-    
+
     public double next(int val) {
         int idx = cnt % arr.length;
         s += val - arr[idx];
@@ -141,7 +141,7 @@ class MovingAverage {
     public MovingAverage(int size) {
         n = size;
     }
-    
+
     public double next(int val) {
         if (q.size() == n) {
             s -= q.pollFirst();
@@ -167,7 +167,7 @@ public:
     MovingAverage(int size) {
         arr.resize(size);
     }
-    
+
     double next(int val) {
         int idx = cnt % arr.size();
         s += val - arr[idx];
@@ -195,7 +195,7 @@ public:
     MovingAverage(int size) {
         n = size;
     }
-    
+
     double next(int val) {
         if (q.size() == n)
         {

lcof2/剑指 Offer II 065. 最短的单词编码/README.md

@@ -311,7 +311,7 @@ class Trie {
 public:
     vector<Trie*> children;
     Trie() : children(26) {}
-    
+
     int insert(string w) {
         Trie* node = this;
         bool pref = true;

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

@@ -110,15 +110,15 @@ class Solution:
 class Trie:
     def __init__(self):
         self.children = [None] * 2
-    
+
     def insert(self, x):
         node = self
         for i in range(30, -1, -1):
             v = (x >> i) & 1
             if node.children[v] is None:
                 node.children[v] = Trie()
             node = node.children[v]
-    
+
     def search(self, x):
         node = self
         res = 0

lcof2/剑指 Offer II 115. 重建序列/README.md

@@ -69,7 +69,6 @@
 
 <p>注意：本题与主站 444&nbsp;题相同：<a href="https://leetcode.cn/problems/sequence-reconstruction/">https://leetcode-cn.com/problems/sequence-reconstruction/</a></p>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->

lcof2/剑指 Offer II 115. 重建序列/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def sequenceReconstruction(self, nums: List[int], sequences: List[List[int]]) -> bool:
+    def sequenceReconstruction(
+        self, nums: List[int], sequences: List[List[int]]
+    ) -> bool:
         g = defaultdict(list)
         indeg = [0] * len(nums)
         for seq in sequences:

solution/0300-0399/0336.Palindrome Pairs/README.md

@@ -32,8 +32,6 @@
 <strong>输出：</strong>[[0,1],[1,0]]
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0400-0499/0444.Sequence Reconstruction/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def sequenceReconstruction(self, nums: List[int], sequences: List[List[int]]) -> bool:
+    def sequenceReconstruction(
+        self, nums: List[int], sequences: List[List[int]]
+    ) -> bool:
         g = defaultdict(list)
         indeg = [0] * len(nums)
         for seq in sequences:

solution/0500-0599/0554.Brick Wall/README.md

@@ -28,8 +28,6 @@
 <strong>输出：</strong>3
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0700-0799/0775.Global and Local Inversions/README.md

@@ -42,8 +42,6 @@
 <strong>解释：</strong>有 2 个全局倒置，和 1 个局部倒置。
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0800-0899/0830.Positions of Large Groups/README.md

@@ -48,8 +48,6 @@
 <strong>输出：</strong>[]
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/1800-1899/1858.Longest Word With All Prefixes/README_EN.md

@@ -166,7 +166,7 @@ private:
     bool isEnd;
 public:
     Trie() : children(26), isEnd(false) {}
-    
+
     void insert(string word) {
         Trie* node = this;
         for (char c : word)
@@ -177,7 +177,7 @@ public:
         }
         node->isEnd = true;
     }
-    
+
     bool search(string word) {
         Trie* node = this;
         for (char c : word)

solution/2100-2199/2195.Append K Integers With Minimal Sum/Solution.py

@@ -5,7 +5,7 @@ def minimalKSum(self, nums: List[int], k: int) -> int:
         nums.sort()
         ans = 0
         for a, b in pairwise(nums):
-            n = min(k,  b - a - 1)
+            n = min(k, b - a - 1)
             if n <= 0:
                 continue
             k -= n

solution/2200-2299/2269.Find the K-Beauty of a Number/Solution.py

@@ -3,7 +3,7 @@ def divisorSubstrings(self, num: int, k: int) -> int:
         ans = 0
         s = str(num)
         for i in range(len(s) - k + 1):
-            t = int(s[i: i + k])
+            t = int(s[i : i + k])
             if t and num % t == 0:
                 ans += 1
         return ans