add 287 427 1405

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -267,6 +267,7 @@ export default sidebar({
             "0278",
             "0279",
             "0283",
+            "0287",
             "0289",
             "0290",
             "0295",
@@ -313,6 +314,7 @@ export default sidebar({
             "0415",
             "0416",
             "0426",
+            "0427",
             "0430",
             "0432",
             "0433",
@@ -459,6 +461,7 @@ export default sidebar({
           text: "1400-1499",
           collapsible: true,
           children: [
+            "1405",
             "1419",
             "1441",
             "1472",

src/leetcode/algorithm/binary_search.md

@@ -235,7 +235,7 @@ function bsearch(arr, value) {
 | 题号 | 标题 | 题解 | 标签 | 难度 |
 | :------: | :------ | :------: | :------ | :------ |
 | 69 | [x 的平方根 ](https://leetcode.com/problems/sqrtx) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0069) |  [`数学`](/leetcode/outline/tag/math.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#15bd66>Easy</font> |
-| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> |
 | 367 | [有效的完全平方数](https://leetcode.com/problems/valid-perfect-square) |  |  [`数学`](/leetcode/outline/tag/math.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#15bd66>Easy</font> |
 | 1300 | [转变数组后最接近目标值的数组和](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target) |  |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> |
@@ -254,7 +254,7 @@ function bsearch(arr, value) {
 | 702 | [搜索长度未知的有序数组](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) |  |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`交互`](/leetcode/outline/tag/interactive.md) | <font color=#ffb800>Medium</font> |
 | 349 | [两个数组的交集](https://leetcode.com/problems/intersection-of-two-arrays) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `2+` | <font color=#15bd66>Easy</font> |
 | 350 | [两个数组的交集 II](https://leetcode.com/problems/intersection-of-two-arrays-ii) |  |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `2+` | <font color=#15bd66>Easy</font> |
-| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 719 | [找出第 K 小的数对距离](https://leetcode.com/problems/find-k-th-smallest-pair-distance) |  |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) `1+` | <font color=#ff334b>Hard</font> |
 | 259 | [较小的三数之和](https://leetcode.com/problems/3sum-smaller) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0259) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1011 | [在 D 天内送达包裹的能力](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days) |  |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> |

src/leetcode/outline/plan/codetop_list.md

@@ -168,7 +168,7 @@ headerDepth: 0
 | 347 | [前 K 个高频元素](https://leetcode.com/problems/top-k-frequent-elements) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0347) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `5+` | <font color=#ffb800>Medium</font> | 25 |
 | 106 | [从中序与后序遍历序列构造二叉树](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0106) |  [`树`](/leetcode/outline/tag/tree.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> | 25 |
 | 213 | [打家劫舍 II](https://leetcode.com/problems/house-robber-ii) |  |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 25 |
-| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> | 25 |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> | 25 |
 | 剑指 Offer 27 | [二叉树的镜像](https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_27_1) |  [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) `1+` | <font color=#15bd66>Easy</font> | 25 |
 | 剑指 Offer 29 | [顺时针打印矩阵](https://leetcode.cn/problems/shun-shi-zhen-da-yin-ju-zhen-lcof) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_29_1) |  [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Easy</font> | 24 |
 | 96 | [不同的二叉搜索树](https://leetcode.com/problems/unique-binary-search-trees) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0096) |  [`树`](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) [`数学`](/leetcode/outline/tag/math.md) `2+` | <font color=#ffb800>Medium</font> | 24 |

src/leetcode/outline/plan/top_200_list.md

@@ -438,7 +438,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 频次 |
 | :------: | :------ | :------: | :------ | :------ | :------: |
 | 69 | [x 的平方根 ](https://leetcode.com/problems/sqrtx) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0069) |  [`数学`](/leetcode/outline/tag/math.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#15bd66>Easy</font> | 109 |
-| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> | 25 |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> | 25 |
 | 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> | 37 |
 | 400 | [第 N 位数字](https://leetcode.com/problems/nth-digit) |  |  [`数学`](/leetcode/outline/tag/math.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> | 23 |
 

src/leetcode/outline/plan/top_300_list.md

@@ -261,7 +261,7 @@ headerDepth: 0
 | 718 | [最长重复子数组](https://leetcode.com/problems/maximum-length-of-repeated-subarray) |  |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) `3+` | <font color=#ffb800>Medium</font> |
 | 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0050) |  [`递归`](/leetcode/outline/tag/recursion.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> |
 | 29 | [两数相除](https://leetcode.com/problems/divide-two-integers) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0029) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数学`](/leetcode/outline/tag/math.md) | <font color=#ffb800>Medium</font> |
-| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) |  |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 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> |
 | 153 | [寻找旋转排序数组中的最小值](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0153) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> |
 | 162 | [寻找峰值](https://leetcode.com/problems/find-peak-element) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0162) |  [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#ffb800>Medium</font> |

src/leetcode/outline/solution_list.md

@@ -1,6 +1,6 @@
 # 1.3 LeetCode 题解
 
-已完成 402 道
+已完成 405 道
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 |
@@ -204,6 +204,7 @@
 | 278 | [第一个错误的版本](https://leetcode.com/problems/first-bad-version) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0278) |  [`二分查找`](/leetcode/outline/tag/binary-search.md) [`交互`](/leetcode/outline/tag/interactive.md) | <font color=#15bd66>Easy</font> |
 | 279 | [完全平方数](https://leetcode.com/problems/perfect-squares) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0279) |  [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数学`](/leetcode/outline/tag/math.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
 | 283 | [移动零](https://leetcode.com/problems/move-zeroes) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0283) |  [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#15bd66>Easy</font> |
+| 287 | [寻找重复数](https://leetcode.com/problems/find-the-duplicate-number) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0287) |  [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 289 | [生命游戏](https://leetcode.com/problems/game-of-life) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0289) |  [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> |
 | 290 | [单词规律](https://leetcode.com/problems/word-pattern) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0290) |  [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> |
 | 295 | [数据流的中位数](https://leetcode.com/problems/find-median-from-data-stream) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0295) |  [`设计`](/leetcode/outline/tag/design.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`数据流`](/leetcode/outline/tag/data-stream.md) `2+` | <font color=#ff334b>Hard</font> |
@@ -238,6 +239,7 @@
 | 415 | [字符串相加](https://leetcode.com/problems/add-strings) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0415) |  [`数学`](/leetcode/outline/tag/math.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Easy</font> |
 | 416 | [分割等和子集](https://leetcode.com/problems/partition-equal-subset-sum) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0416) |  [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> |
 | 426 | [将二叉搜索树转化为排序的双向链表](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0426) |  [`栈`](/leetcode/outline/tag/stack.md) [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) `4+` | <font color=#ffb800>Medium</font> |
+| 427 | [建立四叉树](https://leetcode.com/problems/construct-quad-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0427) |  [`树`](/leetcode/outline/tag/tree.md) [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `1+` | <font color=#ffb800>Medium</font> |
 | 430 | [扁平化多级双向链表](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0430) |  [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`链表`](/leetcode/outline/tag/linked-list.md) [`双向链表`](/leetcode/outline/tag/doubly-linked-list.md) | <font color=#ffb800>Medium</font> |
 | 432 | [全 O(1) 的数据结构](https://leetcode.com/problems/all-oone-data-structure) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0432) |  [`设计`](/leetcode/outline/tag/design.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`链表`](/leetcode/outline/tag/linked-list.md) `1+` | <font color=#ff334b>Hard</font> |
 | 433 | [最小基因变化](https://leetcode.com/problems/minimum-genetic-mutation) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0433) |  [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#ffb800>Medium</font> |
@@ -324,6 +326,7 @@
 | 1312 | [让字符串成为回文串的最少插入次数](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1312) |  [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ff334b>Hard</font> |
 | 1331 | [数组序号转换](https://leetcode.com/problems/rank-transform-of-an-array) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1331) |  [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#15bd66>Easy</font> |
 | 1381 | [设计一个支持增量操作的栈](https://leetcode.com/problems/design-a-stack-with-increment-operation) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1381) |  [`栈`](/leetcode/outline/tag/stack.md) [`设计`](/leetcode/outline/tag/design.md) [`数组`](/leetcode/outline/tag/array.md) | <font color=#ffb800>Medium</font> |
+| 1405 | [最长快乐字符串](https://leetcode.com/problems/longest-happy-string) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1405) |  [`贪心`](/leetcode/outline/tag/greedy.md) [`字符串`](/leetcode/outline/tag/string.md) [`堆（优先队列）`](/leetcode/outline/tag/heap-priority-queue.md) | <font color=#ffb800>Medium</font> |
 | 1419 | [数青蛙](https://leetcode.com/problems/minimum-number-of-frogs-croaking) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1419) |  [`字符串`](/leetcode/outline/tag/string.md) [`计数`](/leetcode/outline/tag/counting.md) | <font color=#ffb800>Medium</font> |
 | 1441 | [用栈操作构建数组](https://leetcode.com/problems/build-an-array-with-stack-operations) | [[✓]](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) | [[✓]](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> |