add 2628 2630

Author: 2xiao

assets/output/0001.md

@@ -138,7 +138,7 @@ time complexity?
 | 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) | [[✓]](/problem/0560.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
 | 653 | [两数之和 IV - 输入二叉搜索树](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | <font color=#15bd66>Easy</font> |
 | 1099 | [小于 K 的两数之和](https://leetcode.com/problems/two-sum-less-than-k) |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | <font color=#15bd66>Easy</font> |
-| 1679 | [K 和数对的最大数目](https://leetcode.com/problems/max-number-of-k-sum-pairs) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 1679 | [K 和数对的最大数目](https://leetcode.com/problems/max-number-of-k-sum-pairs) | [[✓]](/problem/1679.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1711 | [大餐计数](https://leetcode.com/problems/count-good-meals) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | <font color=#ffb800>Medium</font> |
 | 2006 | [差的绝对值为 K 的数对数目](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) | <font color=#15bd66>Easy</font> |
 | 2023 | [连接后等于目标字符串的字符串对](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |

assets/output/0007.md

@@ -6,68 +6,100 @@
 
 Given a signed 32-bit integer `x`, return `x` _with its digits reversed_. If
 reversing `x` causes the value to go outside the signed 32-bit integer range
-`-[2^31, 2^31 - 1]`, then return `0`.
+`[-231, 231 - 1]`, then return `0`.
 
 **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:**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
 
 ## 题目大意
 
 给你一个 32 位的有符号整数 `x` ，返回将 `x` 中的数字部分反转后的结果。
 
-如果反转后整数超过 32 位的有符号整数的范围 `[−231, 2^31 − 1]` ，就返回 0。
+如果反转后整数超过 32 位的有符号整数的范围 `[−231, 231 − 1]` ，就返回 0。
 
 **假设环境不允许存储 64 位整数（有符号或无符号）。**
 
 **示例 1：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 123
->
+> 
 > **输出：** 321
+> 
+> 
 
 **示例 2：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = -123
->
+> 
 > **输出：** -321
+> 
+> 
 
 **示例 3：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 120
->
+> 
 > **输出：** 21
+> 
+> 
 
 **示例 4：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** x = 0
->
+> 
 > **输出：** 0
+> 
+> 
 
 **提示：**
 
-- `-2^31 <= x <= 2^31 - 1`
+  * `-231 <= x <= 231 - 1`
+
 
 ## 解题思路
 
@@ -90,4 +122,4 @@ or unsigned).**
 | 8 | [字符串转换整数 (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | [[✓]](/problem/0008.md) |  [`字符串`](/tag/string.md) | <font color=#ffb800>Medium</font> |
 | 190 | [颠倒二进制位](https://leetcode.com/problems/reverse-bits) | [[✓]](/problem/0190.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | <font color=#15bd66>Easy</font> |
 | 2119 | [反转两次的数字](https://leetcode.com/problems/a-number-after-a-double-reversal) |  |  [`数学`](/tag/math.md) | <font color=#15bd66>Easy</font> |
-| 2442 | [反转之后不同整数的数目](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | <font color=#ffb800>Medium</font> |
+| 2442 | [反转之后不同整数的数目](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | <font color=#ffb800>Medium</font> |