add 2530 3318 3319 3321

Author: 2xiao

assets/output/0001.md

@@ -136,7 +136,7 @@ time complexity?
 | 18 | [四数之和](https://leetcode.com/problems/4sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0018) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 167 | [两数之和 II - 输入有序数组](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0167) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> |
 | 170 | [两数之和 III - 数据结构设计](https://leetcode.com/problems/two-sum-iii-data-structure-design) |  |  [`设计`](/leetcode/outline/tag/design.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#15bd66>Easy</font> |
-| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
+| 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0560) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
 | 653 | [两数之和 IV - 输入二叉搜索树](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |  |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `4+` | <font color=#15bd66>Easy</font> |
 | 1099 | [小于 K 的两数之和](https://leetcode.com/problems/two-sum-less-than-k) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) `1+` | <font color=#15bd66>Easy</font> |
 | 1679 | [K 和数对的最大数目](https://leetcode.com/problems/max-number-of-k-sum-pairs) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |

assets/output/0056.md

@@ -108,7 +108,7 @@ that cover all the intervals in the input_.
 | 2158 | [每天绘制新区域的数量](https://leetcode.com/problems/amount-of-new-area-painted-each-day) |  |  [`线段树`](/leetcode/outline/tag/segment-tree.md) [`数组`](/leetcode/outline/tag/array.md) [`有序集合`](/leetcode/outline/tag/ordered-set.md) | <font color=#ff334b>Hard</font> |
 | 2213 | [由单个字符重复的最长子字符串](https://leetcode.com/problems/longest-substring-of-one-repeating-character) |  |  [`线段树`](/leetcode/outline/tag/segment-tree.md) [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ff334b>Hard</font> |
 | 2276 | [统计区间中的整数数目](https://leetcode.com/problems/count-integers-in-intervals) |  |  [`设计`](/leetcode/outline/tag/design.md) [`线段树`](/leetcode/outline/tag/segment-tree.md) [`有序集合`](/leetcode/outline/tag/ordered-set.md) | <font color=#ff334b>Hard</font> |
-| 2406 | [将区间分为最少组数](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `3+` | <font color=#ffb800>Medium</font> |
+| 2406 | [将区间分为最少组数](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/2406) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `3+` | <font color=#ffb800>Medium</font> |
 | 2446 | [判断两个事件是否存在冲突](https://leetcode.com/problems/determine-if-two-events-have-conflict) |  |  [`数组`](/leetcode/outline/tag/array.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> |
 | 2580 | [统计将重叠区间合并成组的方案数](https://leetcode.com/problems/count-ways-to-group-overlapping-ranges) |  |  [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 2848 | [与车相交的点](https://leetcode.com/problems/points-that-intersect-with-cars) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) | <font color=#15bd66>Easy</font> |

assets/output/0075.md

@@ -2,6 +2,7 @@
 
 🟠 <font color=#ffb800>Medium</font>&emsp; 🔖&ensp; [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md)&emsp; 🔗&ensp;[`LeetCode`](https://leetcode.com/problems/sort-colors)
 
+
 ## 题目
 
 Given an array `nums` with `n` objects colored red, white, or blue, sort them
@@ -14,58 +15,84 @@ and blue, respectively.
 
 You must solve this problem without using the library's sort function.
 
+
+
 **Example 1:**
 
 > Input: nums = [2,0,2,1,1,0]
->
+> 
 > Output: [0,0,1,1,2,2]
 
 **Example 2:**
 
 > Input: nums = [2,0,1]
->
+> 
 > Output: [0,1,2]
 
 **Constraints:**
 
-- `n == nums.length`
-- `1 <= n <= 300`
-- `nums[i]` is either `0`, `1`, or `2`.
+  * `n == nums.length`
+  * `1 <= n <= 300`
+  * `nums[i]` is either `0`, `1`, or `2`.
+
 
-**Follow up:** Could you come up with a one-pass algorithm using only
+
+**Follow up:**  Could you come up with a one-pass algorithm using only
 constant extra space?
 
+
 ## 题目大意
 
-给定一个包含红色、白色和蓝色、共 `n` 个元素的数组 `nums`
+给定一个包含红色、白色和蓝色、共 `n` __ 个元素的数组 `nums`
 ，**[原地](https://baike.baidu.com/item/%E5%8E%9F%E5%9C%B0%E7%AE%97%E6%B3%95)
 **对它们进行排序，使得相同颜色的元素相邻，并按照红色、白色、蓝色顺序排列。
 
 我们使用整数 `0`、 `1` 和 `2` 分别表示红色、白色和蓝色。
 
 必须在不使用库内置的 sort 函数的情况下解决这个问题。
 
+
+
 **示例 1：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** nums = [2,0,2,1,1,0]
->
+> 
 > **输出：**[0,0,1,1,2,2]
+> 
+> 
 
 **示例 2：**
 
+> 
+> 
+> 
+> 
+> 
 > **输入：** nums = [2,0,1]
->
+> 
 > **输出：**[0,1,2]
+> 
+> 
+
+
 
 **提示：**
 
-- `n == nums.length`
-- `1 <= n <= 300`
-- `nums[i]` 为 `0`、`1` 或 `2`
+  * `n == nums.length`
+  * `1 <= n <= 300`
+  * `nums[i]` 为 `0`、`1` 或 `2`
+
+
 
 **进阶：**
 
-- 你能想出一个仅使用常数空间的一趟扫描算法吗？
+  * 你能想出一个仅使用常数空间的一趟扫描算法吗？
+
 
 ## 解题思路
 

assets/output/0076.md

@@ -147,7 +147,7 @@ The testcases will be generated such that the answer is **unique**.
 | 209 | [长度最小的子数组](https://leetcode.com/problems/minimum-size-subarray-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0209) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`前缀和`](/leetcode/outline/tag/prefix-sum.md) `1+` | <font color=#ffb800>Medium</font> |
 | 239 | [滑动窗口最大值](https://leetcode.com/problems/sliding-window-maximum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0239) |  [`队列`](/leetcode/outline/tag/queue.md) [`数组`](/leetcode/outline/tag/array.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) `2+` | <font color=#ff334b>Hard</font> |
 | 567 | [字符串的排列](https://leetcode.com/problems/permutation-in-string) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0567) |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |
-| 632 | [最小区间](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `3+` | <font color=#ff334b>Hard</font> |
+| 632 | [最小区间](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0632) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `3+` | <font color=#ff334b>Hard</font> |
 | 727 | [最小窗口子序列](https://leetcode.com/problems/minimum-window-subsequence) |  |  [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) | <font color=#ff334b>Hard</font> |
 | 3297 | [统计重新排列后包含另一个字符串的子字符串数目 I](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i) |  |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) | <font color=#ffb800>Medium</font> |
 | 3298 | [统计重新排列后包含另一个字符串的子字符串数目 II](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii) |  |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) | <font color=#ff334b>Hard</font> |

assets/output/0148.md

@@ -123,7 +123,7 @@ memory (i.e. constant space)?
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
 | 21 | [合并两个有序链表](https://leetcode.com/problems/merge-two-sorted-lists) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0021) |  [`递归`](/leetcode/outline/tag/recursion.md) [`链表`](/leetcode/outline/tag/linked-list.md) | <font color=#15bd66>Easy</font> |
-| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
+| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0075) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 147 | [对链表进行插入排序](https://leetcode.com/problems/insertion-sort-list) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0147) |  [`链表`](/leetcode/outline/tag/linked-list.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 2046 | [给按照绝对值排序的链表排序](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values) |  |  [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 

assets/output/0200.md

@@ -140,7 +140,7 @@ are all surrounded by water.
 | 323 | [无向图中连通分量的数目](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `1+` | <font color=#ffb800>Medium</font> |
 | 419 | [棋盘上的战舰](https://leetcode.com/problems/battleships-in-a-board) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> |
 | 694 | [不同岛屿的数量](https://leetcode.com/problems/number-of-distinct-islands) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
-| 695 | [岛屿的最大面积](https://leetcode.com/problems/max-area-of-island) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
+| 695 | [岛屿的最大面积](https://leetcode.com/problems/max-area-of-island) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0695) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1905 | [统计子岛屿](https://leetcode.com/problems/count-sub-islands) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1992 | [找到所有的农场组](https://leetcode.com/problems/find-all-groups-of-farmland) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) `1+` | <font color=#ffb800>Medium</font> |
 | 2316 | [统计无向图中无法互相到达点对数](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `1+` | <font color=#ffb800>Medium</font> |

assets/output/0280.md

@@ -31,7 +31,7 @@
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
-| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
+| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0075) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 324 | [摆动排序 II](https://leetcode.com/problems/wiggle-sort-ii) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `2+` | <font color=#ffb800>Medium</font> |
 | 1968 | [构造元素不等于两相邻元素平均值的数组](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 

assets/output/0324.md

@@ -99,7 +99,7 @@ extra space?
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
-| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
+| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0075) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 215 | [数组中的第K个最大元素](https://leetcode.com/problems/kth-largest-element-in-an-array) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0215) |  [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`快速选择`](/leetcode/outline/tag/quickselect.md) `2+` | <font color=#ffb800>Medium</font> |
 | 280 | [摆动排序](https://leetcode.com/problems/wiggle-sort) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
 | 1968 | [构造元素不等于两相邻元素平均值的数组](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors) |  |  [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |

assets/output/0419.md

@@ -115,7 +115,7 @@ without modifying the values `board`?
 | :------: | :------ | :------: | :------ | :------ |
 | 200 | [岛屿数量](https://leetcode.com/problems/number-of-islands) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0200) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
 | 286 | [墙与门](https://leetcode.com/problems/walls-and-gates) |  |  [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> |
-| 695 | [岛屿的最大面积](https://leetcode.com/problems/max-area-of-island) |  |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
+| 695 | [岛屿的最大面积](https://leetcode.com/problems/max-area-of-island) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0695) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`并查集`](/leetcode/outline/tag/union-find.md) `2+` | <font color=#ffb800>Medium</font> |
 | 994 | [腐烂的橘子](https://leetcode.com/problems/rotting-oranges) |  |  [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> |
 
 <style>