docs: update code

Author: acbin

lcci/03.02.Min Stack/README_EN.md

@@ -34,7 +34,6 @@ minStack.getMin();   --&gt; return -2.</pre>
 
 ```python
 class MinStack:
-
     def __init__(self):
         self.stk1 = []
         self.stk2 = [inf]

lcci/03.03.Stack of Plates/README.md

@@ -38,7 +38,6 @@
 
 ```python
 class StackOfPlates:
-
     def __init__(self, cap: int):
         self.cap = cap
         self.stk = []

lcci/03.03.Stack of Plates/README_EN.md

@@ -45,7 +45,6 @@
 
 ```python
 class StackOfPlates:
-
     def __init__(self, cap: int):
         self.cap = cap
         self.stk = []

lcci/04.01.Route Between Nodes/README.md

@@ -65,7 +65,9 @@ class Solution:
 
 ```python
 class Solution:
-    def findWhetherExistsPath(self, n: int, graph: List[List[int]], start: int, target: int) -> bool:
+    def findWhetherExistsPath(
+        self, n: int, graph: List[List[int]], start: int, target: int
+    ) -> bool:
         g = defaultdict(list)
         for u, v in graph:
             g[u].append(v)

lcci/04.01.Route Between Nodes/README_EN.md

@@ -66,7 +66,9 @@ class Solution:
 
 ```python
 class Solution:
-    def findWhetherExistsPath(self, n: int, graph: List[List[int]], start: int, target: int) -> bool:
+    def findWhetherExistsPath(
+        self, n: int, graph: List[List[int]], start: int, target: int
+    ) -> bool:
         g = defaultdict(list)
         for u, v in graph:
             g[u].append(v)

lcci/04.02.Minimum Height Tree/README.md

@@ -31,6 +31,7 @@
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
         def dfs(l, r):

lcci/04.02.Minimum Height Tree/README_EN.md

@@ -44,6 +44,7 @@ One possible answer is: [0,-3,9,-10,null,5]，which represents the following tre
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def sortedArrayToBST(self, nums: List[int]) -> TreeNode:
         def dfs(l, r):

lcci/04.03.List of Depth/README.md

@@ -44,6 +44,7 @@
 #         self.left = None
 #         self.right = None
 
+
 # Definition for singly-linked list.
 # class ListNode:
 #     def __init__(self, x):

lcci/04.03.List of Depth/README_EN.md

@@ -52,6 +52,7 @@ Level order traversal.
 #         self.left = None
 #         self.right = None
 
+
 # Definition for singly-linked list.
 # class ListNode:
 #     def __init__(self, x):

lcci/05.01.Insert Into Bits/README_EN.md

@@ -5,37 +5,21 @@
 ## Description
 
 <p>You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.</p>
-
 <p><strong>Example1:</strong></p>
-
 <pre>
 
-
-
 <strong> Input</strong>: N = 10000000000, M = 10011, i = 2, j = 6
 
-
-
 <strong> Output</strong>: N = 10001001100
 
-
-
 </pre>
-
 <p><strong>Example2:</strong></p>
-
 <pre>
 
-
-
-<strong> Input</strong>:  N = 0, M = 11111, i = 0, j = 4
-
-
+<strong> Input</strong>: N = 0, M = 11111, i = 0, j = 4
 
 <strong> Output</strong>: N = 11111
 
-
-
 </pre>
 
 ## Solutions
@@ -46,7 +30,6 @@
 
 ```python
 
-
 ```
 
 ### **Java**
@@ -66,7 +49,6 @@ class Solution {
 
 ```
 
-
 ```
 
 <!-- tabs:end -->

lcci/17.05.Find Longest Subarray/README.md

@@ -67,7 +67,7 @@ class Solution:
                     k = j + 1
             else:
                 vis[s] = i
-        return array[k: k + mx]
+        return array[k : k + mx]
 ```
 
 ### **Java**

lcci/17.05.Find Longest Subarray/README_EN.md

@@ -57,7 +57,7 @@ class Solution:
                     k = j + 1
             else:
                 vis[s] = i
-        return array[k: k + mx]
+        return array[k : k + mx]
 ```
 
 ### **Java**

lcci/17.20.Continuous Median/README.md

@@ -55,7 +55,6 @@ findMedian() -> 2
 
 ```python
 class MedianFinder:
-
     def __init__(self):
         """
         initialize your data structure here.

lcci/17.20.Continuous Median/README_EN.md

@@ -45,7 +45,6 @@ findMedian() -> 2
 
 ```python
 class MedianFinder:
-
     def __init__(self):
         """
         initialize your data structure here.

lcci/17.23.Max Black Square/README.md

@@ -89,7 +89,12 @@ class Solution:
         for k in range(n, 0, -1):
             for i in range(n - k + 1):
                 for j in range(n - k + 1):
-                    if down[i][j] >= k and right[i][j] >= k and right[i + k - 1][j] >= k and down[i][j + k - 1] >= k:
+                    if (
+                        down[i][j] >= k
+                        and right[i][j] >= k
+                        and right[i + k - 1][j] >= k
+                        and down[i][j + k - 1] >= k
+                    ):
                         return [i, j, k]
         return []
 ```

lcci/17.23.Max Black Square/README_EN.md

@@ -69,7 +69,12 @@ class Solution:
         for k in range(n, 0, -1):
             for i in range(n - k + 1):
                 for j in range(n - k + 1):
-                    if down[i][j] >= k and right[i][j] >= k and right[i + k - 1][j] >= k and down[i][j + k - 1] >= k:
+                    if (
+                        down[i][j] >= k
+                        and right[i][j] >= k
+                        and right[i + k - 1][j] >= k
+                        and down[i][j + k - 1] >= k
+                    ):
                         return [i, j, k]
         return []
 ```

run_format.py

@@ -6,30 +6,31 @@
 
 def prettier_format():
     """Format code with prettier"""
-    for suffix in ['md', 'js', 'ts']:
-        command = f'npx prettier --write "**/*.{suffix}"'
-        os.system(command)
-
-    # format php code
+    # before prettier, add `<?php` to php files
     for root, _, files in os.walk(path):
         for name in files:
             if name.endswith('.php'):
-                p1 = root + '/' + name
-                with open(p1, 'r', encoding='utf-8') as f:
+                p = root + '/' + name
+                with open(p, 'r', encoding='utf-8') as f:
                     content = f.read()
                     content = '<?php\n' + content
-                with open(p1, 'w', encoding='utf-8') as f:
+                with open(p, 'w', encoding='utf-8') as f:
                     f.write(content)
-    command = 'npx prettier --write "**/*.php"'
-    os.system(command)
+
+    # start formatting with prettier
+    for suffix in ['md', 'js', 'ts', 'php']:
+        command = f'npx prettier --write "**/*.{suffix}"'
+        os.system(command)
+
+    # after prettier, remove `<?php` from php files
     for root, _, files in os.walk(path):
         for name in files:
             if name.endswith('.php'):
-                p1 = root + '/' + name
-                with open(p1, 'r', encoding='utf-8') as f:
+                p = root + '/' + name
+                with open(p, 'r', encoding='utf-8') as f:
                     content = f.read()
                     content = content.replace('<?php\n', '')
-                with open(p1, 'w', encoding='utf-8') as f:
+                with open(p, 'w', encoding='utf-8') as f:
                     f.write(content)
 
 
@@ -48,11 +49,11 @@ def clang_format():
     for root, _, files in os.walk(path):
         for name in files:
             if name.endswith('.md'):
-                p1 = root + '/' + name
-                with open(p1, 'r', encoding='utf-8') as f:
+                p = root + '/' + name
+                with open(p, 'r', encoding='utf-8') as f:
                     content = f.read()
                     x = content
-                print(p1)
+                print(p)
                 for suf in suffix:
                     res = re.findall(f'```{suf}\n(.*?)```', content, re.S)
                     if not res:
@@ -66,7 +67,7 @@ def clang_format():
                         with open(p2, 'r', encoding='utf-8') as f:
                             content = f.read()
                         content = x.replace(v, content)
-                        with open(p1, 'w', encoding='utf-8') as f:
+                        with open(p, 'w', encoding='utf-8') as f:
                             f.write(content)
                         os.remove(p2)
 
@@ -108,6 +109,6 @@ def git_add():
 
 if __name__ == '__main__':
     prettier_format()
-    black_format()
+    # black_format()
     # clang_format()
     git_add()

solution/0000-0099/0022.Generate Parentheses/README.md

@@ -38,9 +38,9 @@
 
 **方法一：DFS + 剪枝**
 
-题目中 $n$ 的范围为 $[1, 8]$，因此我们直接通过“暴力搜索 + 剪枝”的方式快速解决本题。
+题目中 $n$ 的范围为 $[1, 8]$，因此我们直接通过“暴力搜索 + 剪枝”的方式通过本题。
 
-我们设计函数 `dfs(l, r, t)`，其中 $l$ 和 $r$ 分别表示左括号和右括号的数量，而 $t$ 表示当前的括号序列。那么我们可以得到如下的递归结构：
+我们设计一个函数 $dfs(l, r, t)$，其中 $l$ 和 $r$ 分别表示左括号和右括号的数量，而 $t$ 表示当前的括号序列。那么我们可以得到如下的递归结构：
 
 -   如果 $l \gt n$ 或者 $r \gt n$ 或者 $l \lt r$，那么当前括号组合 $t$ 不合法，直接返回；
 -   如果 $l = n$ 且 $r = n$，那么当前括号组合 $t$ 合法，将其加入答案数组 `ans` 中，直接返回；

solution/1700-1799/1732.Find the Highest Altitude/README.md

@@ -191,7 +191,9 @@ class Solution {
         $max = 0;
         for ($i = 0; $i < count($gain); $i++) {
             $tmp += $gain[$i];
-            if ($tmp > $max) $max = $tmp;
+            if ($tmp > $max) {
+                $max = $tmp;
+            }
         }
         return $max;
     }

solution/1700-1799/1732.Find the Highest Altitude/README_EN.md

@@ -161,7 +161,9 @@ class Solution {
         $max = 0;
         for ($i = 0; $i < count($gain); $i++) {
             $tmp += $gain[$i];
-            if ($tmp > $max) $max = $tmp;
+            if ($tmp > $max) {
+                $max = $tmp;
+            }
         }
         return $max;
     }