add 25 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -551,33 +551,56 @@ export default sidebar({
       "1013",
       "1018",
       "1021",
+      "1022",
+      "1025",
+      "1030",
+      "1037",
+      "1046",
       "1047",
       "1049",
+      "1051",
       "1068",
       "1071",
       "1072",
-      "1081"
+      "1078",
+      "1081",
+      "1089"
     ]
   },
   {
     "text": "1100-1199",
     "collapsible": true,
     "children": [
+      "1103",
       "1106",
+      "1108",
+      "1122",
+      "1128",
       "1137",
       "1143",
       "1146",
       "1148",
+      "1154",
+      "1160",
       "1161",
+      "1175",
+      "1184",
+      "1185",
+      "1189",
       "1190"
     ]
   },
   {
     "text": "1200-1299",
     "collapsible": true,
     "children": [
+      "1200",
       "1207",
+      "1217",
+      "1221",
+      "1232",
       "1233",
+      "1252",
       "1268",
       "1277",
       "1288"
@@ -709,6 +732,7 @@ export default sidebar({
       "2261",
       "2262",
       "2275",
+      "2287",
       "2290"
     ]
   },
@@ -847,6 +871,7 @@ export default sidebar({
       "2822",
       "2823",
       "2825",
+      "2872",
       "2877",
       "2878",
       "2879",

src/book/greedy.md

@@ -33,7 +33,7 @@
 | 122 | 买卖股票的最佳时机 II | [[✓]](/problem/0122.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) |
 | 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) |
 | 1710 | 卡车上的最大单元数 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-units-on-a-truck) [🔗](https://leetcode.com/problems/maximum-units-on-a-truck) |
-| 1217 | 玩筹码 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position) [🔗](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) |
+| 1217 | 玩筹码 | [[✓]](/problem/1217.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-cost-to-move-chips-to-the-same-position) [🔗](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) |
 | 1247 | 交换字符使得字符串相同 |  |  [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-strings-equal) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal) |
 | 1400 | 构造 K 个回文字符串 |  |  [`贪心`](/tag/greedy.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/construct-k-palindrome-strings) [🔗](https://leetcode.com/problems/construct-k-palindrome-strings) |
 | 921 | 使括号有效的最少添加 | [[✓]](/problem/0921.md) |  [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-add-to-make-parentheses-valid) [🔗](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) |

src/book/sort.md

@@ -401,7 +401,7 @@ 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) |
-| 1122 | 数组的相对排序 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/relative-sort-array) [🔗](https://leetcode.com/problems/relative-sort-array) |
+| 1122 | 数组的相对排序 | [[✓]](/problem/1122.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数排序`](/tag/counting-sort.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/relative-sort-array) [🔗](https://leetcode.com/problems/relative-sort-array) |
 
 * 桶排序