add 13 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -104,7 +104,9 @@ export default sidebar({
       "0085",
       "0086",
       "0088",
+      "0089",
       "0090",
+      "0091",
       "0092",
       "0093",
       "0094",
@@ -176,6 +178,9 @@ export default sidebar({
       "0156",
       "0160",
       "0162",
+      "0164",
+      "0165",
+      "0166",
       "0167",
       "0168",
       "0169",
@@ -186,9 +191,11 @@ export default sidebar({
       "0174",
       "0175",
       "0177",
+      "0179",
       "0181",
       "0182",
       "0183",
+      "0187",
       "0188",
       "0189",
       "0190",
@@ -206,6 +213,7 @@ export default sidebar({
       "0201",
       "0202",
       "0203",
+      "0204",
       "0205",
       "0206",
       "0207",
@@ -214,17 +222,20 @@ export default sidebar({
       "0210",
       "0211",
       "0212",
+      "0213",
       "0215",
       "0216",
       "0217",
       "0219",
       "0221",
       "0222",
+      "0223",
       "0224",
       "0225",
       "0226",
       "0227",
       "0228",
+      "0229",
       "0230",
       "0231",
       "0232",
@@ -508,6 +519,7 @@ export default sidebar({
       "0908",
       "0909",
       "0914",
+      "0916",
       "0917",
       "0918",
       "0921",
@@ -1123,6 +1135,7 @@ export default sidebar({
     "collapsible": true,
     "children": [
       "3011",
+      "3042",
       "3097"
     ]
   },

src/book/bit.md

@@ -16,7 +16,7 @@
 | 1009 | 十进制整数的反码 | [[✓]](/problem/1009.md) |  [`位运算`](/tag/bit-manipulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/complement-of-base-10-integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer) |
 | 191 | 位1的个数 | [[✓]](/problem/0191.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-1-bits) [🔗](https://leetcode.com/problems/number-of-1-bits) |
 | 371 | 两整数之和 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/sum-of-two-integers) [🔗](https://leetcode.com/problems/sum-of-two-integers) |
-| 89 | 格雷编码 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/gray-code) [🔗](https://leetcode.com/problems/gray-code) |
+| 89 | 格雷编码 | [[✓]](/problem/0089.md) |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/gray-code) [🔗](https://leetcode.com/problems/gray-code) |
 | 201 | 数字范围按位与 | [[✓]](/problem/0201.md) |  [`位运算`](/tag/bit-manipulation.md) | 🟠 | [🀄️](https://leetcode.cn/problems/bitwise-and-of-numbers-range) [🔗](https://leetcode.com/problems/bitwise-and-of-numbers-range) |
 | 338 | 比特位计数 | [[✓]](/problem/0338.md) |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
 | 136 | 只出现一次的数字 | [[✓]](/problem/0136.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) |

src/book/dynamic_programming.md

@@ -75,7 +75,7 @@
 | 152 | 乘积最大子数组 | [[✓]](/problem/0152.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-product-subarray) [🔗](https://leetcode.com/problems/maximum-product-subarray) |
 | 918 | 环形子数组的最大和 | [[✓]](/problem/0918.md) |  [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`分治`](/tag/divide-and-conquer.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-sum-circular-subarray) [🔗](https://leetcode.com/problems/maximum-sum-circular-subarray) |
 | 198 | 打家劫舍 | [[✓]](/problem/0198.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber) [🔗](https://leetcode.com/problems/house-robber) |
-| 213 | 打家劫舍 II |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-ii) [🔗](https://leetcode.com/problems/house-robber-ii) |
+| 213 | 打家劫舍 II | [[✓]](/problem/0213.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/house-robber-ii) [🔗](https://leetcode.com/problems/house-robber-ii) |
 | 740 | 删除并获得点数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/delete-and-earn) [🔗](https://leetcode.com/problems/delete-and-earn) |
 | 1388 | 3n 块披萨 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/pizza-with-3n-slices) [🔗](https://leetcode.com/problems/pizza-with-3n-slices) |
 | 873 | 最长的斐波那契子序列的长度 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/length-of-longest-fibonacci-subsequence) [🔗](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence) |
@@ -84,7 +84,7 @@
 | 368 | 最大整除子集 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/largest-divisible-subset) [🔗](https://leetcode.com/problems/largest-divisible-subset) |
 | 32 | 最长有效括号 | [[✓]](/problem/0032.md) |  [`栈`](/tag/stack.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/longest-valid-parentheses) [🔗](https://leetcode.com/problems/longest-valid-parentheses) |
 | 413 | 等差数列划分 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/arithmetic-slices) [🔗](https://leetcode.com/problems/arithmetic-slices) |
-| 91 | 解码方法 |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/decode-ways) [🔗](https://leetcode.com/problems/decode-ways) |
+| 91 | 解码方法 | [[✓]](/problem/0091.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/decode-ways) [🔗](https://leetcode.com/problems/decode-ways) |
 | 639 | 解码方法 II |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/decode-ways-ii) [🔗](https://leetcode.com/problems/decode-ways-ii) |
 | 132 | 分割回文串 II | [[✓]](/problem/0132.md) |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/palindrome-partitioning-ii) [🔗](https://leetcode.com/problems/palindrome-partitioning-ii) |
 | 1220 | 统计元音字母序列的数目 |  |  [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-vowels-permutation) [🔗](https://leetcode.com/problems/count-vowels-permutation) |

src/book/enumeration.md

@@ -11,7 +11,7 @@
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 1 | 两数之和 | [[✓]](/problem/0001.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum) [🔗](https://leetcode.com/problems/two-sum) |
-| 204 | 计数质数 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-primes) [🔗](https://leetcode.com/problems/count-primes) |
+| 204 | 计数质数 | [[✓]](/problem/0204.md) |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-primes) [🔗](https://leetcode.com/problems/count-primes) |
 | 1925 | 统计平方和三元组的数目 | [[✓]](/problem/1925.md) |  [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-square-sum-triples) [🔗](https://leetcode.com/problems/count-square-sum-triples) |
 | 1450 | 在既定时间做作业的学生人数 | [[✓]](/problem/1450.md) |  [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time) [🔗](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time) |
 | 1620 | 网络信号最好的坐标 |  |  [`数组`](/tag/array.md) [`枚举`](/tag/enumeration.md) | 🟠 | [🀄️](https://leetcode.cn/problems/coordinate-with-maximum-network-quality) [🔗](https://leetcode.com/problems/coordinate-with-maximum-network-quality) |

src/book/sort.md

@@ -410,14 +410,14 @@ function swap(arr, i, j) {
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 912 | 排序数组 |  |  [`数组`](/tag/array.md) [`分治`](/tag/divide-and-conquer.md) [`桶排序`](/tag/bucket-sort.md) `5+` | 🟠 | [🀄️](https://leetcode.cn/problems/sort-an-array) [🔗](https://leetcode.com/problems/sort-an-array) |
 | 220 | 存在重复元素 III |  |  [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`有序集合`](/tag/ordered-set.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/contains-duplicate-iii) [🔗](https://leetcode.com/problems/contains-duplicate-iii) |
-| 164 | 最大间距 |  |  [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`基数排序`](/tag/radix-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-gap) [🔗](https://leetcode.com/problems/maximum-gap) |
+| 164 | 最大间距 | [[✓]](/problem/0164.md) |  [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`基数排序`](/tag/radix-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-gap) [🔗](https://leetcode.com/problems/maximum-gap) |
 
 * 基数排序
 
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 164 | 最大间距 |  |  [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`基数排序`](/tag/radix-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-gap) [🔗](https://leetcode.com/problems/maximum-gap) |
+| 164 | 最大间距 | [[✓]](/problem/0164.md) |  [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`基数排序`](/tag/radix-sort.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-gap) [🔗](https://leetcode.com/problems/maximum-gap) |
 | 561 | 数组拆分 | [[✓]](/problem/0561.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/array-partition) [🔗](https://leetcode.com/problems/array-partition) |
 
 * 其他排序
@@ -428,7 +428,7 @@ function swap(arr, i, j) {
 | 217 | 存在重复元素 | [[✓]](/problem/0217.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/contains-duplicate) [🔗](https://leetcode.com/problems/contains-duplicate) |
 | 136 | 只出现一次的数字 | [[✓]](/problem/0136.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) |
 | 56 | 合并区间 | [[✓]](/problem/0056.md) |  [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/merge-intervals) [🔗](https://leetcode.com/problems/merge-intervals) |
-| 179 | 最大数 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/largest-number) [🔗](https://leetcode.com/problems/largest-number) |
+| 179 | 最大数 | [[✓]](/problem/0179.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/largest-number) [🔗](https://leetcode.com/problems/largest-number) |
 | 384 | 打乱数组 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`随机化`](/tag/randomized.md) | 🟠 | [🀄️](https://leetcode.cn/problems/shuffle-an-array) [🔗](https://leetcode.com/problems/shuffle-an-array) |
 | 剑指 Offer 45 | 把数组排成最小的数 | [[✓]](/offer/jz_offer_45_1.md) |  [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof) |