add 22 solutions

Author: 2xiao

assets/output/0007.md

@@ -23,30 +23,27 @@ reversing `x` causes the value to go outside the signed 32-bit integer range
 **Assume the environment does not allow you to store 64-bit integers (signed
 or unsigned).**
 
-
-
 **Example 1:**
 
 > Input: x = 123
-> 
+>
 > Output: 321
 
 **Example 2:**
 
 > Input: x = -123
-> 
+>
 > Output: -321
 
 **Example 3:**
 
 > Input: x = 120
-> 
+>
 > Output: 21
 
 **Constraints:**
 
-  * `-231 <= x <= 231 - 1`
-
+- `-2^31 <= x <= 2^31 - 1`
 
 ## 题目大意
 
@@ -58,60 +55,31 @@ or unsigned).**
 
 **示例 1：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = 123
-> 
+>
 > **输出：** 321
-> 
-> 
 
 **示例 2：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = -123
-> 
+>
 > **输出：** -321
-> 
-> 
 
 **示例 3：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = 120
-> 
+>
 > **输出：** 21
-> 
-> 
 
 **示例 4：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = 0
-> 
+>
 > **输出：** 0
-> 
-> 
 
 **提示：**
 
-  * `-231 <= x <= 231 - 1`
-
+- `-2^31 <= x <= 2^31 - 1`
 
 ## 解题思路
 
@@ -134,4 +102,4 @@ or unsigned).**
 | 8 | 字符串转换整数 (atoi) | [[✓]](/problem/0008.md) |  [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/string-to-integer-atoi) [🔗](https://leetcode.com/problems/string-to-integer-atoi) |
 | 190 | 颠倒二进制位 | [[✓]](/problem/0190.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-bits) [🔗](https://leetcode.com/problems/reverse-bits) |
 | 2119 | 反转两次的数字 |  |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/a-number-after-a-double-reversal) [🔗](https://leetcode.com/problems/a-number-after-a-double-reversal) |
-| 2442 | 反转之后不同整数的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations) [🔗](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |
+| 2442 | 反转之后不同整数的数目 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-number-of-distinct-integers-after-reverse-operations) [🔗](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |

assets/output/0009.md

@@ -19,105 +19,72 @@ keywords:
 Given an integer `x`, return `true` _if_`x` _is a_ _**palindrome**_ _,
 and_`false` _otherwise_.
 
-
-
 **Example 1:**
 
 > Input: x = 121
-> 
+>
 > Output: true
-> 
+>
 > Explanation: 121 reads as 121 from left to right and from right to left.
 
 **Example 2:**
 
 > Input: x = -121
-> 
+>
 > Output: false
-> 
+>
 > Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
 
 **Example 3:**
 
 > Input: x = 10
-> 
+>
 > Output: false
-> 
+>
 > Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
 
 **Constraints:**
 
-  * `-231 <= x <= 231 - 1`
-
-
+- `-2^31 <= x <= 2^31 - 1`
 
 **Follow up:** Could you solve it without converting the integer to a string?
 
-
 ## 题目大意
 
 给你一个整数 `x` ，如果 `x` 是一个回文整数，返回 `true` ；否则，返回 `false` 。
 
 回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。
 
-  * 例如，`121` 是回文，而 `123` 不是。
-
-
+- 例如，`121` 是回文，而 `123` 不是。
 
 **示例 1：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = 121
-> 
+>
 > **输出：** true
-> 
-> 
 
-**示例  2：**
+**示例 2：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = -121
-> 
+>
 > **输出：** false
-> 
+>
 > **解释：** 从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。
-> 
-> 
 
 **示例 3：**
 
-> 
-> 
-> 
-> 
-> 
 > **输入：** x = 10
-> 
+>
 > **输出：** false
-> 
+>
 > **解释：** 从右向左读, 为 01 。因此它不是一个回文数。
-> 
-> 
-
-
 
 **提示：**
 
-  * `-231 <= x <= 231 - 1`
-
-
+- `-2^31 <= x <= 2^31 - 1`
 
 **进阶：** 你能不将整数转为字符串来解决这个问题吗？
 
-
 ## 解题思路
 
 #### 复杂度分析
@@ -141,4 +108,4 @@ and_`false` _otherwise_.
 | 2396 | 严格回文的数字 |  |  [`脑筋急转弯`](/tag/brainteaser.md) [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/strictly-palindromic-number) [🔗](https://leetcode.com/problems/strictly-palindromic-number) |
 | 2843 | 统计对称整数的数目 |  |  [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-symmetric-integers) [🔗](https://leetcode.com/problems/count-symmetric-integers) |
 | 3260 | 找出最大的 N 位 K 回文数 |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-largest-palindrome-divisible-by-k) [🔗](https://leetcode.com/problems/find-the-largest-palindrome-divisible-by-k) |
-| 3272 | 统计好整数的数目 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`组合数学`](/tag/combinatorics.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-count-of-good-integers) [🔗](https://leetcode.com/problems/find-the-count-of-good-integers) |
+| 3272 | 统计好整数的数目 |  |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`组合数学`](/tag/combinatorics.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-the-count-of-good-integers) [🔗](https://leetcode.com/problems/find-the-count-of-good-integers) |

assets/output/0029.md

@@ -32,29 +32,26 @@ this problem, if the quotient is **strictly greater than** `231 - 1`, then
 return `231 - 1`, and if the quotient is **strictly less than** `-231`, then
 return `-231`.
 
-
-
 **Example 1:**
 
 > Input: dividend = 10, divisor = 3
-> 
+>
 > Output: 3
-> 
+>
 > Explanation: 10/3 = 3.33333.. which is truncated to 3.
 
 **Example 2:**
 
 > Input: dividend = 7, divisor = -3
-> 
+>
 > Output: -2
-> 
+>
 > Explanation: 7/-3 = -2.33333.. which is truncated to -2.
 
 **Constraints:**
 
-  * `-231 <= dividend, divisor <= 231 - 1`
-  * `divisor != 0`
-
+- `-2^31 <= dividend, divisor <= 2^31 - 1`
+- `divisor != 0`
 
 ## 题目大意
 
@@ -67,41 +64,26 @@ return `-231`.
 **注意：** 假设我们的环境只能存储 **32 位** 有符号整数，其数值范围是 `[−231,  231 − 1]` 。本题中，如果商 **严格大于**
 `231 − 1` ，则返回 `231 − 1` ；如果商 **严格小于** `-231` ，则返回 `-231` 。
 
+**示例 1:**
 
-
-**示例  1:**
-
-> 
-> 
-> 
-> 
-> 
 > **输入:** dividend = 10, divisor = 3
-> 
+>
 > **输出:** 3
-> 
+>
 > **解释:** 10/3 = 3.33333.. ，向零截断后得到 3 。
 
-**示例  2:**
+**示例 2:**
 
-> 
-> 
-> 
-> 
-> 
 > **输入:** dividend = 7, divisor = -3
-> 
+>
 > **输出:** -2
-> 
+>
 > **解释:** 7/-3 = -2.33333.. ，向零截断后得到 -2 。
 
-
-
 **提示：**
 
-  * `-231 <= dividend, divisor <= 231 - 1`
-  * `divisor != 0`
-
+- `-2^31 <= dividend, divisor <= 2^31 - 1`
+- `divisor != 0`
 
 ## 解题思路
 
@@ -114,4 +96,4 @@ return `-231`.
 
 ```javascript
 
-```
+```