style: format code and documents

lcci/16.10.Living People/README.md

@@ -116,7 +116,6 @@ function maxAliveYear(birth: number[], death: number[]): number {
     }
     return res;
 }
-
 ```
 
 ### **Rust**

lcci/16.10.Living People/README_EN.md

@@ -111,7 +111,6 @@ function maxAliveYear(birth: number[], death: number[]): number {
     }
     return res;
 }
-
 ```
 
 ### **Rust**

lcp/LCP 34. 二叉树染色/README.md

@@ -61,7 +61,7 @@ class Solution:
                 for j in range(k + 1):
                     ans[0] = max(ans[0], l[i] + r[j])
             return ans
-        
+
         return max(dfs(root))
 ```
 

solution/0200-0299/0241.Different Ways to Add Parentheses/README.md

@@ -77,7 +77,7 @@ class Solution:
                             else:
                                 ans.append(a * b)
             return ans
-        
+
         return dfs(expression)
 ```
 

solution/0200-0299/0241.Different Ways to Add Parentheses/README_EN.md

@@ -67,7 +67,7 @@ class Solution:
                             else:
                                 ans.append(a * b)
             return ans
-        
+
         return dfs(expression)
 ```
 

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/0500-0599/0540.Single Element in a Sorted Array/README.md

@@ -58,8 +58,8 @@ for (int i = 0; i < n - 1; i += 2) {
 return nums[n - 1];
 ```
 
-偶数下标：当 `nums[i] != nums[i + 1] && i % 2  == 0` 成立，结果便是 `nums[i]`。
-奇数下标：当 `nums[i] != nums[i - 1] && i % 2  == 1` 成立，结果便是 `nums[i - 1]`。
+偶数下标：当 `nums[i] != nums[i + 1] && i % 2 == 0` 成立，结果便是 `nums[i]`。
+奇数下标：当 `nums[i] != nums[i - 1] && i % 2 == 1` 成立，结果便是 `nums[i - 1]`。
 
 于是二分模板就有了：
 

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

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

solution/0700-0799/0745.Prefix and Suffix Search/README.md

@@ -31,8 +31,6 @@ WordFilter wordFilter = new WordFilter(["apple"]);
 wordFilter.f("a", "e"); // 返回 0 ，因为下标为 0 的单词的 prefix = "a" 且 suffix = 'e" 。
 </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/2100-2199/2140.Solving Questions With Brainpower/README.md

@@ -93,7 +93,7 @@ class Solution {
         this.questions = questions;
         memo = new long[questions.length];
         Arrays.fill(memo, -1);
-        return dfs(0);    
+        return dfs(0);
     }
 
     private long dfs(int i) {
@@ -117,7 +117,7 @@ class Solution {
 public:
     long long mostPoints(vector<vector<int>>& questions) {
         vector<long long> memo(questions.size(), -1);
-        return dfs(0, questions, memo); 
+        return dfs(0, questions, memo);
     }
 
     long long dfs(int i, vector<vector<int>>& questions, vector<long long>& memo) {

solution/2100-2199/2140.Solving Questions With Brainpower/README_EN.md

@@ -83,7 +83,7 @@ class Solution {
         this.questions = questions;
         memo = new long[questions.length];
         Arrays.fill(memo, -1);
-        return dfs(0);    
+        return dfs(0);
     }
 
     private long dfs(int i) {
@@ -107,7 +107,7 @@ class Solution {
 public:
     long long mostPoints(vector<vector<int>>& questions) {
         vector<long long> memo(questions.size(), -1);
-        return dfs(0, questions, memo); 
+        return dfs(0, questions, memo);
     }
 
     long long dfs(int i, vector<vector<int>>& questions, vector<long long>& memo) {

solution/2300-2399/2320.Count Number of Ways to Place Houses/README.md

@@ -128,12 +128,13 @@ func countHousePlacements(n int) int {
 ```ts
 function countHousePlacements(n: number): number {
     const mod = BigInt(10 ** 9 + 7);
-    let pre = 1n, count = 2n;
+    let pre = 1n,
+        count = 2n;
     for (let i = 2; i <= n; i++) {
         [count, pre] = [(count + pre) % mod, count];
     }
     return Number(count ** 2n % mod);
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2320.Count Number of Ways to Place Houses/README_EN.md

@@ -120,12 +120,13 @@ func countHousePlacements(n int) int {
 ```ts
 function countHousePlacements(n: number): number {
     const mod = BigInt(10 ** 9 + 7);
-    let pre = 1n, count = 2n;
+    let pre = 1n,
+        count = 2n;
     for (let i = 2; i <= n; i++) {
         [count, pre] = [(count + pre) % mod, count];
     }
     return Number(count ** 2n % mod);
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README.md

@@ -49,7 +49,6 @@ It can be proven that 3 days is the minimum number of days needed.
 	<li><code>1 &lt;= jobs[i], workers[i] &lt;= 10<sup>5</sup></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->

solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README_EN.md

@@ -47,7 +47,6 @@ It can be proven that 3 days is the minimum number of days needed.
 	<li><code>1 &lt;= jobs[i], workers[i] &lt;= 10<sup>5</sup></code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->

solution/2300-2399/2325.Decode the Message/README.md

@@ -156,7 +156,8 @@ func decodeMessage(key string, message string) string {
 ```ts
 function decodeMessage(key: string, message: string): string {
     let decodeMap = new Map();
-    const m = key.length, n = 26;
+    const m = key.length,
+        n = 26;
     for (let i = 0, j = 0; i < m; i++) {
         let char = key.charAt(i);
         if (char != ' ' && !decodeMap.has(char)) {
@@ -169,7 +170,7 @@ function decodeMessage(key: string, message: string): string {
         ans.push(char == ' ' ? ' ' : decodeMap.get(char));
     }
     return ans.join('');
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2325.Decode the Message/README_EN.md

@@ -142,7 +142,8 @@ func decodeMessage(key string, message string) string {
 ```ts
 function decodeMessage(key: string, message: string): string {
     let decodeMap = new Map();
-    const m = key.length, n = 26;
+    const m = key.length,
+        n = 26;
     for (let i = 0, j = 0; i < m; i++) {
         let char = key.charAt(i);
         if (char != ' ' && !decodeMap.has(char)) {
@@ -155,7 +156,7 @@ function decodeMessage(key: string, message: string): string {
         ans.push(char == ' ' ? ' ' : decodeMap.get(char));
     }
     return ans.join('');
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2325.Decode the Message/Solution.ts

@@ -1,6 +1,7 @@
 function decodeMessage(key: string, message: string): string {
     let decodeMap = new Map();
-    const m = key.length, n = 26;
+    const m = key.length,
+        n = 26;
     for (let i = 0, j = 0; i < m; i++) {
         let char = key.charAt(i);
         if (char != ' ' && !decodeMap.has(char)) {
@@ -13,4 +14,4 @@ function decodeMessage(key: string, message: string): string {
         ans.push(char == ' ' ? ' ' : decodeMap.get(char));
     }
     return ans.join('');
-};
+}

solution/2300-2399/2326.Spiral Matrix IV/README.md

@@ -218,10 +218,17 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
  * }
  */
 
- function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
-    const dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]];
+function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
+    const dirs = [
+        [0, 1],
+        [1, 0],
+        [0, -1],
+        [-1, 0],
+    ];
     let ans = Array.from({ length: m }, v => new Array(n).fill(-1));
-    let i = 0, j = 0, k = 0;
+    let i = 0,
+        j = 0,
+        k = 0;
     while (head) {
         ans[i][j] = head.val;
         head = head.next;
@@ -234,7 +241,7 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
         j = j + dirs[k][1];
     }
     return ans;
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2326.Spiral Matrix IV/README_EN.md

@@ -210,10 +210,17 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
  * }
  */
 
- function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
-    const dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]];
+function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
+    const dirs = [
+        [0, 1],
+        [1, 0],
+        [0, -1],
+        [-1, 0],
+    ];
     let ans = Array.from({ length: m }, v => new Array(n).fill(-1));
-    let i = 0, j = 0, k = 0;
+    let i = 0,
+        j = 0,
+        k = 0;
     while (head) {
         ans[i][j] = head.val;
         head = head.next;
@@ -226,7 +233,7 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
         j = j + dirs[k][1];
     }
     return ans;
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2326.Spiral Matrix IV/Solution.ts

@@ -10,10 +10,17 @@
  * }
  */
 
- function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
-    const dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]];
+function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
+    const dirs = [
+        [0, 1],
+        [1, 0],
+        [0, -1],
+        [-1, 0],
+    ];
     let ans = Array.from({ length: m }, v => new Array(n).fill(-1));
-    let i = 0, j = 0, k = 0;
+    let i = 0,
+        j = 0,
+        k = 0;
     while (head) {
         ans[i][j] = head.val;
         head = head.next;
@@ -26,4 +33,4 @@
         j = j + dirs[k][1];
     }
     return ans;
-};
+}

solution/2300-2399/2327.Number of People Aware of a Secret/README.md

@@ -197,7 +197,7 @@ function peopleAwareOfSecret(n: number, delay: number, forget: number): number {
         }
     }
     return Number(pre % BigInt(10 ** 9 + 7));
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2327.Number of People Aware of a Secret/README_EN.md

@@ -185,7 +185,7 @@ function peopleAwareOfSecret(n: number, delay: number, forget: number): number {
         }
     }
     return Number(pre % BigInt(10 ** 9 + 7));
-};
+}
 ```
 
 ### **...**

solution/2300-2399/2327.Number of People Aware of a Secret/Solution.ts

@@ -18,4 +18,4 @@ function peopleAwareOfSecret(n: number, delay: number, forget: number): number {
         }
     }
     return Number(pre % BigInt(10 ** 9 + 7));
-};
+}

solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md

@@ -196,16 +196,24 @@ func countPaths(grid [][]int) int {
 ```ts
 function countPaths(grid: number[][]): number {
     const mod = BigInt(10 ** 9 + 7);
-    const dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]];
-    const m = grid.length, n = grid[0].length;
+    const dirs = [
+        [0, 1],
+        [1, 0],
+        [0, -1],
+        [-1, 0],
+    ];
+    const m = grid.length,
+        n = grid[0].length;
     const dp = Array.from({ length: m }, v => new Array(n).fill(-1n));
 
-    function dfs (x, y) {
+    function dfs(x, y) {
         if (dp[x][y] != -1) return dp[x][y];
         let count = 1n;
         for (let [dx, dy] of dirs) {
-            let i = x + dx, j = y + dy;
-            if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] <= grid[x][y]) continue;
+            let i = x + dx,
+                j = y + dy;
+            if (i < 0 || i >= m || j < 0 || j >= n || grid[i][j] <= grid[x][y])
+                continue;
             count = (count + dfs(i, j)) % mod;
         }
         dp[x][y] = count;
@@ -219,7 +227,7 @@ function countPaths(grid: number[][]): number {
         }
     }
     return Number(sum);
-};
+}
 ```
 
 ### **...**