add 1497

Author: 2xiao

assets/output/1497.md

@@ -442,7 +442,8 @@ export default sidebar({
           children: [
             "1441",
             "1472",
-            "1475"
+            "1475",
+            "1497"
           ],
         },
         {

src/.vuepress/sidebar.ts

@@ -1,6 +1,6 @@
 # 1.3 LeetCode 题解
 
-已完成 366 道
+已完成 367 道
 
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
@@ -307,6 +307,7 @@
 | 1441 | [用栈操作构建数组](https://leetcode.com/problems/build-an-array-with-stack-operations/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1441) |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> |
 | 1472 | [设计浏览器历史记录](https://leetcode.com/problems/design-browser-history/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1472) |  [`栈`](/leetcode/outline/tag/stack.md) [`设计`](/leetcode/outline/tag/design.md) [`数组`](/leetcode/outline/tag/array.md) `3+` | <font color=#ffb800>Medium</font> |
 | 1475 | [商品折扣后的最终价格](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1475) |  [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`单调栈`](/leetcode/outline/tag/monotonic-stack.md) | <font color=#15bd66>Easy</font> |
+| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1497) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1522 | [N 叉树的直径](https://leetcode.com/problems/diameter-of-n-ary-tree/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1522) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) | <font color=#ffb800>Medium</font> |
 | 2196 | [根据描述创建二叉树](https://leetcode.com/problems/create-binary-tree-from-descriptions/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/2196) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `3+` | <font color=#ffb800>Medium</font> |
 | 2259 | [移除指定数字得到的最大结果](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/2259) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`字符串`](/leetcode/outline/tag/string.md) [`枚举`](/leetcode/outline/tag/enumeration.md) | <font color=#15bd66>Easy</font> |

src/leetcode/outline/solution_list.md

@@ -719,7 +719,7 @@
 | 1488 | [避免洪水泛滥](https://leetcode.com/problems/avoid-flood-in-the-city/) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1491 | [去掉最低工资和最高工资后的工资平均值](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Easy</font> |
 | 1493 | [删掉一个元素以后全为 1 的最长子数组](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) | <font color=#ffb800>Medium</font> |
-| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
+| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1497) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1498 | [满足条件的子序列数目](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1499 | [满足不等式的最大值](https://leetcode.com/problems/max-value-of-equation/) |  |  [`队列`](/leetcode/outline/tag/queue.md) [`数组`](/leetcode/outline/tag/array.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) `2+` | <font color=#ff334b>Hard</font> |
 | 1502 | [判断能否形成等差数列](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Easy</font> |

src/leetcode/outline/tag/array.md

@@ -58,7 +58,7 @@
 | 1400 | [构造 K 个回文字符串](https://leetcode.com/problems/construct-k-palindrome-strings/) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1419 | [数青蛙](https://leetcode.com/problems/minimum-number-of-frogs-croaking/) |  |  [`字符串`](/leetcode/outline/tag/string.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1481 | [不同整数的最少数目](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> |
-| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
+| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1497) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1512 | [好数对的数目](https://leetcode.com/problems/number-of-good-pairs/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`数学`](/leetcode/outline/tag/mathematics.md) `1+` | <font color=#15bd66>Easy</font> |
 | 1519 | [子树中标签相同的节点数](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1603 | [设计停车系统](https://leetcode.com/problems/design-parking-system/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`计数`](/leetcode/outline/tag/counting.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Easy</font> |

src/leetcode/outline/tag/counting.md

@@ -290,7 +290,7 @@
 | 1488 | [避免洪水泛滥](https://leetcode.com/problems/avoid-flood-in-the-city/) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1490 | [克隆 N 叉树](https://leetcode.com/problems/clone-n-ary-tree/) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1496 | [判断路径是否相交](https://leetcode.com/problems/path-crossing/) |  |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> |
-| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
+| 1497 | [检查数组对是否可以被 k 整除](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/1497) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1500 | [设计文件分享系统](https://leetcode.com/problems/design-a-file-sharing-system/) |  |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`数据流`](/leetcode/outline/tag/data-streams.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1506 | [找到 N 叉树的根节点](https://leetcode.com/problems/find-root-of-n-ary-tree/) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1512 | [好数对的数目](https://leetcode.com/problems/number-of-good-pairs/) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`数学`](/leetcode/outline/tag/mathematics.md) `1+` | <font color=#15bd66>Easy</font> |

src/leetcode/outline/tag/hash-table.md

@@ -47,10 +47,13 @@ time complexity?
 
 ## 解题思路
 
-这道题最优的做法时间复杂度是 `O(n)`。
-
 使用哈希表，顺序扫描数组，对每一个元素，在 `object` 中找能组合给定值的另一半数字，如果找到了，直接返回 2 个数字的下标即可。如果找不到，就把这个数字存入 `object` 中，等待扫到“另一半”数字的时候，再取出来返回结果。
 
+#### 复杂度分析
+
+- **时间复杂度**：`O(n)`，其中 `n` 是字符串的长度。
+- **空间复杂度**：`O(k)`，其中 `k` 是 `object` 中存放的数字数量，最坏情况下，需要扫描到最后一个数字才能找到结果，此时 `k` 会趋近 `n`。
+
 ## 代码
 
 ```javascript

src/leetcode/problem/0001.md

@@ -60,6 +60,8 @@ The overall run time complexity should be `O(log (m+n))`.
 - 如果 k == 1，则返回两个数组的最小值。
 - 总长度为偶数时，需要同时找到第 `(m + n) / 2` 和第 `(m + n) / 2 + 1` 小的数，并取它们的平均值作为中位数。
 
+#### 复杂度分析
+
 - **时间复杂度**：`O(log(min(m, n)))`，因为每次递归我们会排除掉 `k/2` 个元素，直到找到第 `k` 小的元素，整个过程是对较短数组长度的二分查找。
 - **空间复杂度**：`O(1)`，只使用了常数级别的额外空间。
 

src/leetcode/problem/0004.md

@@ -44,8 +44,10 @@ Given a string `s`, return _the longest_ _palindromic_ _substring_ in `s`.
 - **偶数长度的回文串：**
   以每两个相邻字符的中心向两边扩展判断回文串。
 
-- 时间复杂度：`O(n^2)`，其中 `n` 是字符串的长度。
-- 空间复杂度：`O(1)`。
+#### 复杂度分析
+
+- **时间复杂度**：`O(n^2)`，其中 `n` 是字符串的长度。
+- **空间复杂度**：`O(1)`。
 
 ### 思路二：动态规划
 
@@ -62,8 +64,10 @@ Given a string `s`, return _the longest_ _palindromic_ _substring_ in `s`.
   - `dp[i][i] = true`
   - `s[i] == s[i+1]` 时，`dp[i][i+1] = true`
 
-- 时间复杂度：`O(n^2)`，其中 `n` 是字符串的长度。
-- 空间复杂度：`O(n^2)`。
+#### 复杂度分析
+
+- **时间复杂度**：`O(n^2)`，其中 `n` 是字符串的长度。
+- **空间复杂度**：`O(n^2)`。
 
 ## 代码
 

src/leetcode/problem/0005.md

@@ -41,15 +41,19 @@ If there is no common prefix, return an empty string `""`.
 
 初始化公共前缀为字符串数组中的第一个字符串，然后将数组中的字符串与公共前缀一依次比较，每次比较出不同时就缩小公共前缀，直到公共前缀为空或者遍历完所有字符串数组。
 
-- 时间复杂度：`O(len(strs[0]))` 或 `O(len(strs))`
-- 空间复杂度：`O(len(strs[0]))`
+#### 复杂度分析
+
+- **时间复杂度**：`O(len(strs[0]))` 或 `O(len(strs))`
+- **空间复杂度**：`O(len(strs[0]))`
 
 ### 思路二：二维数组
 
 把字符串列表看成一个二维数组，然后用一个嵌套 `for` 循环计算这个二维数组前面有多少列的元素完全相同即可。
 
-- 时间复杂度：`O(mn)`，其中 `m` 是字符串数组中的字符串的平均长度，`n` 是字符串的数量。最坏情况下，字符串数组中的每个字符串的每个字符都会被比较一次。
-- 空间复杂度：`O(1)`，使用的额外空间复杂度为常数。
+#### 复杂度分析
+
+- **时间复杂度**：`O(mn)`，其中 `m` 是字符串数组中的字符串的平均长度，`n` 是字符串的数量。最坏情况下，字符串数组中的每个字符串的每个字符都会被比较一次。
+- **空间复杂度**：`O(1)`，使用的额外空间复杂度为常数。
 
 ## 代码