update 41 442

Author: 2xiao

assets/output/0027.md

@@ -43,6 +43,11 @@ to get accepted, you need to do the following things:
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript

assets/output/0029.md

@@ -42,6 +42,11 @@ return `-2^31`.
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript

assets/output/0031.md

@@ -65,6 +65,11 @@ place_algorithm)** and use only constant extra memory.
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript

assets/output/0037.md

@@ -6,41 +6,41 @@ Write a program to solve a Sudoku puzzle by filling the empty cells.
 
 A sudoku solution must satisfy **all of the following rules** :
 
-  1. Each of the digits `1-9` must occur exactly once in each row.
-  2. Each of the digits `1-9` must occur exactly once in each column.
-  3. Each of the digits `1-9` must occur exactly once in each of the 9 `3x3` sub-boxes of the grid.
+1. Each of the digits `1-9` must occur exactly once in each row.
+2. Each of the digits `1-9` must occur exactly once in each column.
+3. Each of the digits `1-9` must occur exactly once in each of the 9 `3x3` sub-boxes of the grid.
 
 The `'.'` character indicates empty cells.
 
-
-
 **Example 1:**
 
 ![](https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-
 by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png)
 
 > Input: board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
-> 
+>
 > Output: [["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
-> 
-> Explanation:  The input board is shown above and the only valid solution is shown below:
-> 
-> 
-> 
+>
+> Explanation: The input board is shown above and the only valid solution is shown below:
+>
 > ![](https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png)
 
 **Constraints:**
 
-  * `board.length == 9`
-  * `board[i].length == 9`
-  * `board[i][j]` is a digit or `'.'`.
-  * It is **guaranteed** that the input board has only one solution.
-
+- `board.length == 9`
+- `board[i].length == 9`
+- `board[i][j]` is a digit or `'.'`.
+- It is **guaranteed** that the input board has only one solution.
 
 ## 题目大意
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript
@@ -50,6 +50,7 @@ by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png)
 ## 相关题目
 
 :::: md-demo 相关题目
+
 - [36. 有效的数独](./0036.md)
 - [980. 不同路径 III](https://leetcode.com/problems/unique-paths-iii)
 

assets/output/0038.md

@@ -5,8 +5,8 @@
 The **count-and-say** sequence is a sequence of digit strings defined by the
 recursive formula:
 
-  * `countAndSay(1) = "1"`
-  * `countAndSay(n)` is the way you would "say" the digit string from `countAndSay(n-1)`, which is then converted into a different digit string.
+- `countAndSay(1) = "1"`
+- `countAndSay(n)` is the way you would "say" the digit string from `countAndSay(n-1)`, which is then converted into a different digit string.
 
 To determine how you "say" a digit string, split it into the **minimal**
 number of substrings such that each substring contains exactly **one** unique
@@ -20,41 +20,43 @@ For example, the saying and conversion for digit string `"3322251"`:
 Given a positive integer `n`, return _the_`nth` _term of the **count-and-say**
 sequence_.
 
-
-
 **Example 1:**
 
 > Input: n = 1
-> 
+>
 > Output: "1"
-> 
+>
 > Explanation: This is the base case.
 
 **Example 2:**
 
 > Input: n = 4
-> 
+>
 > Output: "1211"
-> 
+>
 > Explanation:
-> 
+>
 > countAndSay(1) = "1"
-> 
+>
 > countAndSay(2) = say "1" = one 1 = "11"
-> 
+>
 > countAndSay(3) = say "11" = two 1's = "21"
-> 
+>
 > countAndSay(4) = say "21" = one 2 + one 1 = "12" + "11" = "1211"
 
 **Constraints:**
 
-  * `1 <= n <= 30`
-
+- `1 <= n <= 30`
 
 ## 题目大意
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript
@@ -64,6 +66,7 @@ sequence_.
 ## 相关题目
 
 :::: md-demo 相关题目
+
 - [🔒 Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings)
 - [443. 压缩字符串](https://leetcode.com/problems/string-compression)
 

assets/output/0041.md

@@ -41,6 +41,11 @@ auxiliary space.
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript

assets/output/0043.md

@@ -5,34 +5,36 @@
 Given two non-negative integers `num1` and `num2` represented as strings,
 return the product of `num1` and `num2`, also represented as a string.
 
-**Note:**  You must not use any built-in BigInteger library or convert the
+**Note:** You must not use any built-in BigInteger library or convert the
 inputs to integer directly.
 
-
-
 **Example 1:**
 
 > Input: num1 = "2", num2 = "3"
-> 
+>
 > Output: "6"
 
 **Example 2:**
 
 > Input: num1 = "123", num2 = "456"
-> 
+>
 > Output: "56088"
 
 **Constraints:**
 
-  * `1 <= num1.length, num2.length <= 200`
-  * `num1` and `num2` consist of digits only.
-  * Both `num1` and `num2` do not contain any leading zero, except the number `0` itself.
-
+- `1 <= num1.length, num2.length <= 200`
+- `num1` and `num2` consist of digits only.
+- Both `num1` and `num2` do not contain any leading zero, except the number `0` itself.
 
 ## 题目大意
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript
@@ -42,6 +44,7 @@ inputs to integer directly.
 ## 相关题目
 
 :::: md-demo 相关题目
+
 - [2. 两数相加](./0002.md)
 - [66. 加一](./0066.md)
 - [67. 二进制求和](https://leetcode.com/problems/add-binary)

assets/output/0048.md

@@ -9,35 +9,37 @@ You have to rotate the image [**in-place**](https://en.wikipedia.org/wiki/In-
 place_algorithm), which means you have to modify the input 2D matrix directly.
 **DO NOT** allocate another 2D matrix and do the rotation.
 
-
-
 **Example 1:**
 
 ![](https://assets.leetcode.com/uploads/2020/08/28/mat1.jpg)
 
 > Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
-> 
+>
 > Output: [[7,4,1],[8,5,2],[9,6,3]]
 
 **Example 2:**
 
 ![](https://assets.leetcode.com/uploads/2020/08/28/mat2.jpg)
 
 > Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
-> 
+>
 > Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]
 
 **Constraints:**
 
-  * `n == matrix.length == matrix[i].length`
-  * `1 <= n <= 20`
-  * `-1000 <= matrix[i][j] <= 1000`
-
+- `n == matrix.length == matrix[i].length`
+- `1 <= n <= 20`
+- `-1000 <= matrix[i][j] <= 1000`
 
 ## 题目大意
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript
@@ -47,6 +49,7 @@ place_algorithm), which means you have to modify the input 2D matrix directly.
 ## 相关题目
 
 :::: md-demo 相关题目
+
 - [1886. 判断矩阵经轮转后是否一致](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation)
 
 ::::

assets/output/0050.md

@@ -37,6 +37,11 @@ calculates `x` raised to the power `n` (i.e., `xn`).
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript

assets/output/0058.md

@@ -41,6 +41,11 @@ A **word** is a maximal substring consisting of non-space characters only.
 
 ## 解题思路
 
+#### 复杂度分析
+
+- **时间复杂度**：`O()`
+- **空间复杂度**：`O()`
+
 ## 代码
 
 ```javascript