add 10 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -322,6 +322,7 @@ export default sidebar({
       "0378",
       "0379",
       "0380",
+      "0381",
       "0382",
       "0383",
       "0384",
@@ -397,10 +398,12 @@ export default sidebar({
       "0463",
       "0464",
       "0467",
+      "0473",
       "0474",
       "0476",
       "0482",
       "0485",
+      "0486",
       "0492",
       "0494",
       "0495",
@@ -426,10 +429,12 @@ export default sidebar({
       "0518",
       "0520",
       "0521",
+      "0526",
       "0528",
       "0530",
       "0540",
       "0541",
+      "0542",
       "0543",
       "0547",
       "0551",
@@ -860,6 +865,7 @@ export default sidebar({
       "1769",
       "1773",
       "1779",
+      "1780",
       "1784",
       "1790",
       "1791",
@@ -1080,6 +1086,7 @@ export default sidebar({
       "2466",
       "2467",
       "2471",
+      "2481",
       "2490",
       "2491",
       "2493"
@@ -1091,6 +1098,7 @@ export default sidebar({
     "children": [
       "2501",
       "2516",
+      "2523",
       "2530",
       "2542",
       "2554",
@@ -1099,6 +1107,7 @@ export default sidebar({
       "2563",
       "2570",
       "2577",
+      "2579",
       "2583",
       "2593"
     ]
@@ -1226,7 +1235,8 @@ export default sidebar({
       "2924",
       "2938",
       "2940",
-      "2948"
+      "2948",
+      "2965"
     ]
   },
   {

src/book/backtracking.md

@@ -708,7 +708,7 @@ var permuteRepeat = function (nums) {
 | 40 | 组合总和 II | [[✓]](/problem/0040.md) |  [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/combination-sum-ii) [🔗](https://leetcode.com/problems/combination-sum-ii) |
 | 78 | 子集 | [[✓]](/problem/0078.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subsets) [🔗](https://leetcode.com/problems/subsets) |
 | 90 | 子集 II | [[✓]](/problem/0090.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/subsets-ii) [🔗](https://leetcode.com/problems/subsets-ii) |
-| 473 | 火柴拼正方形 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/matchsticks-to-square) [🔗](https://leetcode.com/problems/matchsticks-to-square) |
+| 473 | 火柴拼正方形 | [[✓]](/problem/0473.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/matchsticks-to-square) [🔗](https://leetcode.com/problems/matchsticks-to-square) |
 | 1593 | 拆分字符串使唯一子字符串的数目最大 | [[✓]](/problem/1593.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/split-a-string-into-the-max-number-of-unique-substrings) [🔗](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings) |
 | 1079 | 活字印刷 | [[✓]](/problem/1079.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/letter-tile-possibilities) [🔗](https://leetcode.com/problems/letter-tile-possibilities) |
 | 93 | 复原 IP 地址 | [[✓]](/problem/0093.md) |  [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/restore-ip-addresses) [🔗](https://leetcode.com/problems/restore-ip-addresses) |

src/book/dynamic_programming.md

@@ -204,7 +204,7 @@
 <!-- prettier-ignore -->
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
-| 486 | 预测赢家 |  |  [`递归`](/tag/recursion.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/predict-the-winner) [🔗](https://leetcode.com/problems/predict-the-winner) |
+| 486 | 预测赢家 | [[✓]](/problem/0486.md) |  [`递归`](/tag/recursion.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/predict-the-winner) [🔗](https://leetcode.com/problems/predict-the-winner) |
 | 312 | 戳气球 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/burst-balloons) [🔗](https://leetcode.com/problems/burst-balloons) |
 | 877 | 石子游戏 |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/stone-game) [🔗](https://leetcode.com/problems/stone-game) |
 | 1000 | 合并石头的最低成本 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`前缀和`](/tag/prefix-sum.md) | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-cost-to-merge-stones) [🔗](https://leetcode.com/problems/minimum-cost-to-merge-stones) |
@@ -266,7 +266,7 @@
 | 1434 | 每个人戴不同帽子的方案数 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-wear-different-hats-to-each-other) [🔗](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other) |
 | 1799 | N 次操作后的最大分数和 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximize-score-after-n-operations) [🔗](https://leetcode.com/problems/maximize-score-after-n-operations) |
 | 1681 | 最小不兼容性 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-incompatibility) [🔗](https://leetcode.com/problems/minimum-incompatibility) |
-| 526 | 优美的排列 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/beautiful-arrangement) [🔗](https://leetcode.com/problems/beautiful-arrangement) |
+| 526 | 优美的排列 | [[✓]](/problem/0526.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/beautiful-arrangement) [🔗](https://leetcode.com/problems/beautiful-arrangement) |
 | 351 | 安卓系统手势解锁 🔒 |  |  [`位运算`](/tag/bit-manipulation.md) [`动态规划`](/tag/dynamic-programming.md) [`回溯`](/tag/backtracking.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/android-unlock-patterns) [🔗](https://leetcode.com/problems/android-unlock-patterns) |
 | 464 | 我能赢吗 | [[✓]](/problem/0464.md) |  [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数学`](/tag/math.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/can-i-win) [🔗](https://leetcode.com/problems/can-i-win) |
 | 847 | 访问所有节点的最短路径 |  |  [`位运算`](/tag/bit-manipulation.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/shortest-path-visiting-all-nodes) [🔗](https://leetcode.com/problems/shortest-path-visiting-all-nodes) |

src/book/graph.md

@@ -57,7 +57,7 @@
 | 279 | 完全平方数 | [[✓]](/problem/0279.md) |  [`广度优先搜索`](/tag/breadth-first-search.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/perfect-squares) [🔗](https://leetcode.com/problems/perfect-squares) |
 | 133 | 克隆图 | [[✓]](/problem/0133.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/clone-graph) [🔗](https://leetcode.com/problems/clone-graph) |
 | 733 | 图像渲染 | [[✓]](/problem/0733.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/flood-fill) [🔗](https://leetcode.com/problems/flood-fill) |
-| 542 | 01 矩阵 |  |  [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/01-matrix) [🔗](https://leetcode.com/problems/01-matrix) |
+| 542 | 01 矩阵 | [[✓]](/problem/0542.md) |  [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/01-matrix) [🔗](https://leetcode.com/problems/01-matrix) |
 | 322 | 零钱兑换 | [[✓]](/problem/0322.md) |  [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/coin-change) [🔗](https://leetcode.com/problems/coin-change) |
 | 323 | 无向图中连通分量的数目 🔒 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph) [🔗](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) |
 | 剑指 Offer 13 | 机器人的运动范围 | [[✓]](/offer/jz_offer_13_1.md) |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof) |

src/plan/company_list.md

@@ -163,7 +163,7 @@ headerDepth: 0
 | 253 | 会议室 II 🔒 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/meeting-rooms-ii) [🔗](https://leetcode.com/problems/meeting-rooms-ii) | 14 |
 | 445 | 两数相加 II | [[✓]](/problem/0445.md) |  [`栈`](/tag/stack.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers-ii) [🔗](https://leetcode.com/problems/add-two-numbers-ii) | 14 |
 | 472 | 连接词 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`字典树`](/tag/trie.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/concatenated-words) [🔗](https://leetcode.com/problems/concatenated-words) | 14 |
-| 381 | O(1) 时间插入、删除和获取随机元素 - 允许重复 |  |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed) [🔗](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | 14 |
+| 381 | O(1) 时间插入、删除和获取随机元素 - 允许重复 | [[✓]](/problem/0381.md) |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/insert-delete-getrandom-o1-duplicates-allowed) [🔗](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | 14 |
 | 238 | 除自身以外数组的乘积 | [[✓]](/problem/0238.md) |  [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/product-of-array-except-self) [🔗](https://leetcode.com/problems/product-of-array-except-self) | 14 |
 | 99 | 恢复二叉搜索树 | [[✓]](/problem/0099.md) |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉搜索树`](/tag/binary-search-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/recover-binary-search-tree) [🔗](https://leetcode.com/problems/recover-binary-search-tree) | 12 |
 | 121 | 买卖股票的最佳时机 | [[✓]](/problem/0121.md) |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟢 | [🀄️](https://leetcode.cn/problems/best-time-to-buy-and-sell-stock) [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | 12 |