add 23 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -137,6 +137,7 @@ export default sidebar({
       "0116",
       "0117",
       "0118",
+      "0119",
       "0120",
       "0121",
       "0122",
@@ -148,13 +149,15 @@ export default sidebar({
       "0129",
       "0130",
       "0131",
+      "0132",
       "0133",
       "0134",
       "0135",
       "0136",
       "0137",
       "0138",
       "0139",
+      "0140",
       "0141",
       "0142",
       "0143",
@@ -300,13 +303,20 @@ export default sidebar({
     "collapsible": true,
     "children": [
       "0400",
+      "0401",
+      "0404",
+      "0405",
+      "0409",
+      "0412",
+      "0414",
       "0415",
       "0416",
       "0426",
       "0427",
       "0430",
       "0432",
       "0433",
+      "0434",
       "0435",
       "0436",
       "0437",
@@ -316,13 +326,21 @@ export default sidebar({
       "0442",
       "0443",
       "0445",
+      "0448",
       "0450",
       "0451",
       "0452",
+      "0455",
+      "0458",
       "0459",
       "0460",
+      "0461",
+      "0463",
       "0474",
+      "0476",
+      "0482",
       "0485",
+      "0492",
       "0494",
       "0496",
       "0498"
@@ -353,6 +371,7 @@ export default sidebar({
       "0584",
       "0589",
       "0590",
+      "0594",
       "0595"
     ]
   },
@@ -451,6 +470,7 @@ export default sidebar({
     "children": [
       "1004",
       "1008",
+      "1009",
       "1021",
       "1047",
       "1049",
@@ -594,6 +614,7 @@ export default sidebar({
     "children": [
       "2109",
       "2130",
+      "2182",
       "2196"
     ]
   },
@@ -602,6 +623,7 @@ export default sidebar({
     "collapsible": true,
     "children": [
       "2215",
+      "2220",
       "2257",
       "2259",
       "2260",
@@ -628,6 +650,7 @@ export default sidebar({
     "children": [
       "2405",
       "2406",
+      "2410",
       "2416",
       "2458",
       "2461",

src/book/bit.md

@@ -11,9 +11,9 @@
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 504 | 七进制数 |  |  [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/base-7) [🔗](https://leetcode.com/problems/base-7) |
-| 405 | 数字转换为十六进制数 |  |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-a-number-to-hexadecimal) [🔗](https://leetcode.com/problems/convert-a-number-to-hexadecimal) |
+| 405 | 数字转换为十六进制数 | [[✓]](/problem/0405.md) |  [`位运算`](/tag/bit-manipulation.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/convert-a-number-to-hexadecimal) [🔗](https://leetcode.com/problems/convert-a-number-to-hexadecimal) |
 | 190 | 颠倒二进制位 | [[✓]](/problem/0190.md) |  [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-bits) [🔗](https://leetcode.com/problems/reverse-bits) |
-| 1009 | 十进制整数的反码 |  |  [`位运算`](/tag/bit-manipulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/complement-of-base-10-integer) [🔗](https://leetcode.com/problems/complement-of-base-10-integer) |
+| 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) |

src/book/dynamic_programming.md

@@ -86,7 +86,7 @@
 | 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) |
 | 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 |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/palindrome-partitioning-ii) [🔗](https://leetcode.com/problems/palindrome-partitioning-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) |
 | 338 | 比特位计数 | [[✓]](/problem/0338.md) |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/counting-bits) [🔗](https://leetcode.com/problems/counting-bits) |
 | 801 | 使序列递增的最小交换次数 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-swaps-to-make-sequences-increasing) [🔗](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing) |
@@ -133,7 +133,7 @@
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 118 | 杨辉三角 | [[✓]](/problem/0118.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle) [🔗](https://leetcode.com/problems/pascals-triangle) |
-| 119 | 杨辉三角 II |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
+| 119 | 杨辉三角 II | [[✓]](/problem/0119.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
 | 120 | 三角形最小路径和 | [[✓]](/problem/0120.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/triangle) [🔗](https://leetcode.com/problems/triangle) |
 | 64 | 最小路径和 | [[✓]](/problem/0064.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-path-sum) [🔗](https://leetcode.com/problems/minimum-path-sum) |
 | 174 | 地下城游戏 | [[✓]](/problem/0174.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/dungeon-game) [🔗](https://leetcode.com/problems/dungeon-game) |

src/book/greedy.md

@@ -22,7 +22,7 @@
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 455 | 分发饼干 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/assign-cookies) [🔗](https://leetcode.com/problems/assign-cookies) |
+| 455 | 分发饼干 | [[✓]](/problem/0455.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/assign-cookies) [🔗](https://leetcode.com/problems/assign-cookies) |
 | 860 | 柠檬水找零 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/lemonade-change) [🔗](https://leetcode.com/problems/lemonade-change) |
 | 56 | 合并区间 | [[✓]](/problem/0056.md) |  [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/merge-intervals) [🔗](https://leetcode.com/problems/merge-intervals) |
 | 435 | 无重叠区间 | [[✓]](/problem/0435.md) |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/non-overlapping-intervals) [🔗](https://leetcode.com/problems/non-overlapping-intervals) |

src/book/recursion.md

@@ -40,7 +40,7 @@ function f(n) {
 | 344 | 反转字符串 | [[✓]](/problem/0344.md) |  [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-string) [🔗](https://leetcode.com/problems/reverse-string) |
 | 24 | 两两交换链表中的节点 | [[✓]](/problem/0024.md) |  [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/swap-nodes-in-pairs) [🔗](https://leetcode.com/problems/swap-nodes-in-pairs) |
 | 118 | 杨辉三角 | [[✓]](/problem/0118.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle) [🔗](https://leetcode.com/problems/pascals-triangle) |
-| 119 | 杨辉三角 II |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
+| 119 | 杨辉三角 II | [[✓]](/problem/0119.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/pascals-triangle-ii) [🔗](https://leetcode.com/problems/pascals-triangle-ii) |
 | 206 | 反转链表 | [[✓]](/problem/0206.md) |  [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-linked-list) [🔗](https://leetcode.com/problems/reverse-linked-list) |
 | 92 | 反转链表 II | [[✓]](/problem/0092.md) |  [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/reverse-linked-list-ii) [🔗](https://leetcode.com/problems/reverse-linked-list-ii) |
 | 21 | 合并两个有序链表 | [[✓]](/problem/0021.md) |  [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) | 🟢 | [🀄️](https://leetcode.cn/problems/merge-two-sorted-lists) [🔗](https://leetcode.com/problems/merge-two-sorted-lists) |

src/plan/company_list.md

@@ -49,7 +49,7 @@ headerDepth: 0
 | 538 | 把二叉搜索树转换为累加树 |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉搜索树`](/tag/binary-search-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/convert-bst-to-greater-tree) [🔗](https://leetcode.com/problems/convert-bst-to-greater-tree) | 8 |
 | 2184 | 建造坚实的砖墙的方法数 🔒 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall) [🔗](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall) | 8 |
 | 841 | 钥匙和房间 | [[✓]](/problem/0841.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) | 🟠 | [🀄️](https://leetcode.cn/problems/keys-and-rooms) [🔗](https://leetcode.com/problems/keys-and-rooms) | 5 |
-| 463 | 岛屿的周长 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
+| 463 | 岛屿的周长 | [[✓]](/problem/0463.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/island-perimeter) [🔗](https://leetcode.com/problems/island-perimeter) | 4 |
 | 1568 | 使陆地分离的最少天数 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-number-of-days-to-disconnect-island) [🔗](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island) | 2 |
 
 
@@ -182,7 +182,7 @@ headerDepth: 0
 | 799 | 香槟塔 |  |  [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/champagne-tower) [🔗](https://leetcode.com/problems/champagne-tower) | 3 |
 | 387 | 字符串中的第一个唯一字符 | [[✓]](/problem/0387.md) |  [`队列`](/tag/queue.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/first-unique-character-in-a-string) [🔗](https://leetcode.com/problems/first-unique-character-in-a-string) | 3 |
 | 155 | 最小栈 | [[✓]](/problem/0155.md) |  [`栈`](/tag/stack.md) [`设计`](/tag/design.md) | 🟠 | [🀄️](https://leetcode.cn/problems/min-stack) [🔗](https://leetcode.com/problems/min-stack) | 3 |
-| 140 | 单词拆分 II |  |  [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/word-break-ii) [🔗](https://leetcode.com/problems/word-break-ii) | 2 |
+| 140 | 单词拆分 II | [[✓]](/problem/0140.md) |  [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/word-break-ii) [🔗](https://leetcode.com/problems/word-break-ii) | 2 |
 | 828 | 统计子串中的唯一字符 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-unique-characters-of-all-substrings-of-a-given-string) [🔗](https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string) | 2 |