add 11 solutions

Author: 2xiao

src/.vuepress/sidebar.ts

@@ -247,10 +247,12 @@ export default sidebar({
       "0238",
       "0239",
       "0240",
+      "0241",
       "0242",
       "0257",
       "0258",
       "0259",
+      "0260",
       "0263",
       "0264",
       "0268",
@@ -259,12 +261,14 @@ export default sidebar({
       "0278",
       "0279",
       "0283",
+      "0284",
       "0287",
       "0289",
       "0290",
       "0292",
       "0295",
-      "0297"
+      "0297",
+      "0299"
     ]
   },
   {
@@ -273,6 +277,7 @@ export default sidebar({
     "children": [
       "0300",
       "0303",
+      "0304",
       "0307",
       "0309",
       "0316",
@@ -667,6 +672,7 @@ export default sidebar({
     "text": "1400-1499",
     "collapsible": true,
     "children": [
+      "1400",
       "1403",
       "1405",
       "1408",
@@ -891,6 +897,7 @@ export default sidebar({
       "2108",
       "2109",
       "2114",
+      "2116",
       "2119",
       "2124",
       "2129",
@@ -984,6 +991,8 @@ export default sidebar({
       "2410",
       "2415",
       "2416",
+      "2425",
+      "2429",
       "2458",
       "2461",
       "2462",
@@ -1040,6 +1049,7 @@ export default sidebar({
       "2648",
       "2649",
       "2650",
+      "2657",
       "2665",
       "2666",
       "2667",
@@ -1154,6 +1164,7 @@ export default sidebar({
     "collapsible": true,
     "children": [
       "3203",
+      "3223",
       "3243",
       "3264"
     ]

src/book/bit.md

@@ -21,7 +21,7 @@
 | 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) |
 | 137 | 只出现一次的数字 II | [[✓]](/problem/0137.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-ii) [🔗](https://leetcode.com/problems/single-number-ii) |
-| 260 | 只出现一次的数字 III |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-iii) [🔗](https://leetcode.com/problems/single-number-iii) |
+| 260 | 只出现一次的数字 III | [[✓]](/problem/0260.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/single-number-iii) [🔗](https://leetcode.com/problems/single-number-iii) |
 | 268 | 丢失的数字 | [[✓]](/problem/0268.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `3+` | 🟢 | [🀄️](https://leetcode.cn/problems/missing-number) [🔗](https://leetcode.com/problems/missing-number) |
 | 1349 | 参加考试的最大学生数 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-students-taking-exam) [🔗](https://leetcode.com/problems/maximum-students-taking-exam) |
 | 645 | 错误的集合 | [[✓]](/problem/0645.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/set-mismatch) [🔗](https://leetcode.com/problems/set-mismatch) |

src/book/divide_conquer.md

@@ -13,7 +13,7 @@
 | 4 | 寻找两个正序数组的中位数 | [[✓]](/problem/0004.md) |  [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`分治`](/tag/divide-and-conquer.md) | 🔴 | [🀄️](https://leetcode.cn/problems/median-of-two-sorted-arrays) [🔗](https://leetcode.com/problems/median-of-two-sorted-arrays) |
 | 23 | 合并 K 个升序链表 | [[✓]](/problem/0023.md) |  [`链表`](/tag/linked-list.md) [`分治`](/tag/divide-and-conquer.md) [`堆（优先队列）`](/tag/heap-priority-queue.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/merge-k-sorted-lists) [🔗](https://leetcode.com/problems/merge-k-sorted-lists) |
 | 53 | 最大子数组和 | [[✓]](/problem/0053.md) |  [`数组`](/tag/array.md) [`分治`](/tag/divide-and-conquer.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-subarray) [🔗](https://leetcode.com/problems/maximum-subarray) |
-| 241 | 为运算表达式设计优先级 |  |  [`递归`](/tag/recursion.md) [`记忆化搜索`](/tag/memoization.md) [`数学`](/tag/math.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/different-ways-to-add-parentheses) [🔗](https://leetcode.com/problems/different-ways-to-add-parentheses) |
+| 241 | 为运算表达式设计优先级 | [[✓]](/problem/0241.md) |  [`递归`](/tag/recursion.md) [`记忆化搜索`](/tag/memoization.md) [`数学`](/tag/math.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/different-ways-to-add-parentheses) [🔗](https://leetcode.com/problems/different-ways-to-add-parentheses) |
 | 169 | 多数元素 | [[✓]](/problem/0169.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`分治`](/tag/divide-and-conquer.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/majority-element) [🔗](https://leetcode.com/problems/majority-element) |
 | 50 | Pow(x, n) | [[✓]](/problem/0050.md) |  [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/powx-n) [🔗](https://leetcode.com/problems/powx-n) |
 | 14 | 最长公共前缀 | [[✓]](/problem/0014.md) |  [`字典树`](/tag/trie.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/longest-common-prefix) [🔗](https://leetcode.com/problems/longest-common-prefix) |

src/book/greedy.md

@@ -35,7 +35,7 @@
 | 1710 | 卡车上的最大单元数 | [[✓]](/problem/1710.md) |  [`贪心`](/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 | 玩筹码 | [[✓]](/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) |
+| 1400 | 构造 K 个回文字符串 | [[✓]](/problem/1400.md) |  [`贪心`](/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) |
 | 1029 | 两地调度 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/two-city-scheduling) [🔗](https://leetcode.com/problems/two-city-scheduling) |
 | 1605 | 给定行和列的和求可行矩阵 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-valid-matrix-given-row-and-column-sums) [🔗](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums) |

src/plan/company_list.md

@@ -38,7 +38,7 @@ headerDepth: 0
 | 1825 | 求出 MK 平均值 |  |  [`设计`](/tag/design.md) [`队列`](/tag/queue.md) [`数据流`](/tag/data-stream.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/finding-mk-average) [🔗](https://leetcode.com/problems/finding-mk-average) | 12 |
 | 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) | 11 |
 | 302 | 包含全部黑色像素的最小矩形 🔒 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels) [🔗](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) | 11 |
-| 284 | 窥视迭代器 |  |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`迭代器`](/tag/iterator.md) | 🟠 | [🀄️](https://leetcode.cn/problems/peeking-iterator) [🔗](https://leetcode.com/problems/peeking-iterator) | 11 |
+| 284 | 窥视迭代器 | [[✓]](/problem/0284.md) |  [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`迭代器`](/tag/iterator.md) | 🟠 | [🀄️](https://leetcode.cn/problems/peeking-iterator) [🔗](https://leetcode.com/problems/peeking-iterator) | 11 |
 | 1353 | 最多可以参加的会议数目 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended) [🔗](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended) | 11 |
 | 1406 | 石子游戏 III |  |  [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/stone-game-iii) [🔗](https://leetcode.com/problems/stone-game-iii) | 10 |
 | 1197 | 进击的骑士 🔒 |  |  [`广度优先搜索`](/tag/breadth-first-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-knight-moves) [🔗](https://leetcode.com/problems/minimum-knight-moves) | 10 |

src/plan/contest_list.md

@@ -252,7 +252,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 3222 | 求出硬币游戏的赢家 |  |  [`数学`](/tag/math.md) [`博弈`](/tag/game-theory.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-the-winning-player-in-coin-game) [🔗](https://leetcode.com/problems/find-the-winning-player-in-coin-game) |
-| 3223 | 操作后字符串的最短长度 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-length-of-string-after-operations) [🔗](https://leetcode.com/problems/minimum-length-of-string-after-operations) |
+| 3223 | 操作后字符串的最短长度 | [[✓]](/problem/3223.md) |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-length-of-string-after-operations) [🔗](https://leetcode.com/problems/minimum-length-of-string-after-operations) |
 | 3224 | 使差值相等的最少数组改动次数 |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-array-changes-to-make-differences-equal) [🔗](https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal) |
 | 3225 | 网格图操作后的最大分数 |  |  [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-score-from-grid-operations) [🔗](https://leetcode.com/problems/maximum-score-from-grid-operations) |
 
@@ -1404,7 +1404,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2656 | K 个元素的最大和 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-sum-with-exactly-k-elements) [🔗](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements) |
-| 2657 | 找到两个数组的前缀公共数组 |  |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays) [🔗](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays) |
+| 2657 | 找到两个数组的前缀公共数组 | [[✓]](/problem/2657.md) |  [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-prefix-common-array-of-two-arrays) [🔗](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays) |
 | 2658 | 网格图中鱼的最大数目 |  |  [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`并查集`](/tag/union-find.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-number-of-fish-in-a-grid) [🔗](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid) |
 | 2659 | 将数组清空 |  |  [`贪心`](/tag/greedy.md) [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/make-array-empty) [🔗](https://leetcode.com/problems/make-array-empty) |
 
@@ -1933,7 +1933,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2427 | 公因子的数目 |  |  [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) [`数论`](/tag/number-theory.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-common-factors) [🔗](https://leetcode.com/problems/number-of-common-factors) |
 | 2428 | 沙漏的最大总和 |  |  [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-sum-of-an-hourglass) [🔗](https://leetcode.com/problems/maximum-sum-of-an-hourglass) |
-| 2429 | 最小异或 |  |  [`贪心`](/tag/greedy.md) [`位运算`](/tag/bit-manipulation.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimize-xor) [🔗](https://leetcode.com/problems/minimize-xor) |
+| 2429 | 最小异或 | [[✓]](/problem/2429.md) |  [`贪心`](/tag/greedy.md) [`位运算`](/tag/bit-manipulation.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimize-xor) [🔗](https://leetcode.com/problems/minimize-xor) |
 | 2430 | 对字母串可执行的最大删除数 |  |  [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) [`字符串匹配`](/tag/string-matching.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximum-deletions-on-a-string) [🔗](https://leetcode.com/problems/maximum-deletions-on-a-string) |
 
 
@@ -1945,7 +1945,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2423 | 删除字符使频率相同 |  |  [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/remove-letter-to-equalize-frequency) [🔗](https://leetcode.com/problems/remove-letter-to-equalize-frequency) |
 | 2424 | 最长上传前缀 |  |  [`并查集`](/tag/union-find.md) [`设计`](/tag/design.md) [`树状数组`](/tag/binary-indexed-tree.md) `4+` | 🟠 | [🀄️](https://leetcode.cn/problems/longest-uploaded-prefix) [🔗](https://leetcode.com/problems/longest-uploaded-prefix) |
-| 2425 | 所有数对的异或和 |  |  [`位运算`](/tag/bit-manipulation.md) [`脑筋急转弯`](/tag/brainteaser.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/bitwise-xor-of-all-pairings) [🔗](https://leetcode.com/problems/bitwise-xor-of-all-pairings) |
+| 2425 | 所有数对的异或和 | [[✓]](/problem/2425.md) |  [`位运算`](/tag/bit-manipulation.md) [`脑筋急转弯`](/tag/brainteaser.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/bitwise-xor-of-all-pairings) [🔗](https://leetcode.com/problems/bitwise-xor-of-all-pairings) |
 | 2426 | 满足不等式的数对数目 |  |  [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-pairs-satisfying-inequality) [🔗](https://leetcode.com/problems/number-of-pairs-satisfying-inequality) |
 
 
@@ -2665,7 +2665,7 @@ headerDepth: 0
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 2114 | 句子中的最多单词数 | [[✓]](/problem/2114.md) |  [`数组`](/tag/array.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-number-of-words-found-in-sentences) [🔗](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences) |
 | 2115 | 从给定原材料中找到所有可以做出的菜 |  |  [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) [`数组`](/tag/array.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-all-possible-recipes-from-given-supplies) [🔗](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies) |
-| 2116 | 判断一个括号字符串是否有效 |  |  [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid) [🔗](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid) |
+| 2116 | 判断一个括号字符串是否有效 | [[✓]](/problem/2116.md) |  [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/check-if-a-parentheses-string-can-be-valid) [🔗](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid) |
 | 2117 | 一个区间内所有数乘积的缩写 |  |  [`数学`](/tag/math.md) | 🔴 | [🀄️](https://leetcode.cn/problems/abbreviating-the-product-of-a-range) [🔗](https://leetcode.com/problems/abbreviating-the-product-of-a-range) |
 
 
@@ -4284,7 +4284,7 @@ headerDepth: 0
 | 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
 | :------: | :------ | :------: | :------ | :------: | :------: |
 | 1399 | 统计最大组的数目 | [[✓]](/problem/1399.md) |  [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-largest-group) [🔗](https://leetcode.com/problems/count-largest-group) |
-| 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) |
+| 1400 | 构造 K 个回文字符串 | [[✓]](/problem/1400.md) |  [`贪心`](/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) |
 | 1401 | 圆和矩形是否有重叠 |  |  [`几何`](/tag/geometry.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/circle-and-rectangle-overlapping) [🔗](https://leetcode.com/problems/circle-and-rectangle-overlapping) |
 | 1402 | 做菜顺序 |  |  [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/reducing-dishes) [🔗](https://leetcode.com/problems/reducing-dishes) |