Skip to content

Commit 9c975ba

Browse files
2xiao2xiao
committed
add 10 solutions
1 parent b7d3ab2 commit 9c975ba

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

60 files changed

+2068
-263
lines changed

‎assets/output/1494.md

+37-66
Original file line numberDiff line numberDiff line change
@@ -33,127 +33,98 @@ are taking.
3333
Return _the**minimum** number of semesters needed to take all courses_. The
3434
testcases will be generated such that it is possible to take every course.
3535

36-
37-
3836
**Example 1:**
3937

4038
![](https://assets.leetcode.com/uploads/2020/05/22/leetcode_parallel_courses_1.png)
4139

4240
> Input: n = 4, relations = [[2,1],[3,1],[1,4]], k = 2
43-
>
41+
>
4442
> Output: 3
45-
>
43+
>
4644
> Explanation: The figure above represents the given graph.
47-
>
45+
>
4846
> In the first semester, you can take courses 2 and 3.
49-
>
47+
>
5048
> In the second semester, you can take course 1.
51-
>
49+
>
5250
> In the third semester, you can take course 4.
5351
5452
**Example 2:**
5553

5654
![](https://assets.leetcode.com/uploads/2020/05/22/leetcode_parallel_courses_2.png)
5755

5856
> Input: n = 5, relations = [[2,1],[3,1],[4,1],[1,5]], k = 2
59-
>
57+
>
6058
> Output: 4
61-
>
59+
>
6260
> Explanation: The figure above represents the given graph.
63-
>
61+
>
6462
> In the first semester, you can only take courses 2 and 3 since you cannot take more than two per semester.
65-
>
63+
>
6664
> In the second semester, you can take course 4.
67-
>
65+
>
6866
> In the third semester, you can take course 1.
69-
>
67+
>
7068
> In the fourth semester, you can take course 5.
7169
7270
**Constraints:**
7371

74-
* `1 <= n <= 15`
75-
* `1 <= k <= n`
76-
* `0 <= relations.length <= n * (n-1) / 2`
77-
* `relations[i].length == 2`
78-
* `1 <= prevCoursei, nextCoursei <= n`
79-
* `prevCoursei != nextCoursei`
80-
* All the pairs `[prevCoursei, nextCoursei]` are **unique**.
81-
* The given graph is a directed acyclic graph.
82-
72+
- `1 <= n <= 15`
73+
- `1 <= k <= n`
74+
- `0 <= relations.length <= n * (n-1) / 2`
75+
- `relations[i].length == 2`
76+
- `1 <= prevCoursei, nextCoursei <= n`
77+
- `prevCoursei != nextCoursei`
78+
- All the pairs `[prevCoursei, nextCoursei]` are **unique**.
79+
- The given graph is a directed acyclic graph.
8380

8481
## 题目大意
8582

8683
给你一个整数 `n` 表示某所大学里课程的数目，编号为 `1` 到 `n` ，数组 `relations` 中， `relations[i] = [xi,
87-
yi]` 表示一个先修课的关系，也就是课程 `xi` 必须在课程 `yi` 之前上。同时你还有一个整数 `k` 。
84+
yi]` 表示一个先修课的关系，也就是课程 `xi` 必须在课程 `yi` 之前上。同时你还有一个整数 `k` 。
8885

89-
在一个学期中，你 **最多** 可以同时上 `k` 门课，前提是这些课的先修课在之前的学期里已经上过了。
86+
在一个学期中，你 **最多** 可以同时上 `k` 门课，前提是这些课的先修课在之前的学期里已经上过了。
9087

9188
请你返回上完所有课最少需要多少个学期。题目保证一定存在一种上完所有课的方式。
9289

93-
94-
9590
**示例 1：**
9691

9792
**![](https://assets.leetcode-cn.com/aliyun-lc-
9893
upload/uploads/2020/06/27/leetcode_parallel_courses_1.png)**
9994

100-
>
101-
>
102-
>
103-
>
104-
>
10595
> **输入：** n = 4, relations = [[2,1],[3,1],[1,4]], k = 2
106-
>
107-
> **输出：** 3
108-
>
96+
>
97+
> **输出：** 3
98+
>
10999
> **解释：** 上图展示了题目输入的图。在第一个学期中，我们可以上课程 2 和课程 3 。然后第二个学期上课程 1 ，第三个学期上课程 4 。
110-
>
111-
>
112100
113101
**示例 2：**
114102

115103
**![](https://assets.leetcode-cn.com/aliyun-lc-
116104
upload/uploads/2020/06/27/leetcode_parallel_courses_2.png)**
117105

118-
>
119-
>
120-
>
121-
>
122-
>
123106
> **输入：** n = 5, relations = [[2,1],[3,1],[4,1],[1,5]], k = 2
124-
>
125-
> **输出：** 4
126-
>
107+
>
108+
> **输出：** 4
109+
>
127110
> **解释：** 上图展示了题目输入的图。一个最优方案是：第一学期上课程 2 和 3，第二学期上课程 4 ，第三学期上课程 1 ，第四学期上课程 5 。
128-
>
129-
>
130111
131112
**示例 3：**
132113

133-
>
134-
>
135-
>
136-
>
137-
>
138114
> **输入：** n = 11, relations = [], k = 2
139-
>
115+
>
140116
> **输出：** 6
141-
>
142-
>
143-
144-
145117
146118
**提示：**
147119

148-
* `1 <= n <= 15`
149-
* `1 <= k <= n`
150-
* `0 <= relations.length <= n * (n-1) / 2`
151-
* `relations[i].length == 2`
152-
* `1 <= xi, yi <= n`
153-
* `xi != yi`
154-
* 所有先修关系都是不同的，也就是说 `relations[i] != relations[j]` 。
155-
* 题目输入的图是个有向无环图。
156-
120+
- `1 <= n <= 15`
121+
- `1 <= k <= n`
122+
- `0 <= relations.length <= n * (n-1) / 2`
123+
- `relations[i].length == 2`
124+
- `1 <= xi, yi <= n`
125+
- `xi != yi`
126+
- 所有先修关系都是不同的，也就是说 `relations[i] != relations[j]` 。
127+
- 题目输入的图是个有向无环图。
157128

158129
## 解题思路
159130

@@ -173,4 +144,4 @@ upload/uploads/2020/06/27/leetcode_parallel_courses_2.png)**
173144
<!-- prettier-ignore -->
174145
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
175146
| :------: | :------ | :------: | :------ | :------: | :------: |
176-
| 1136 | 并行课程 🔒 | | [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) | 🟠 | [🀄️](https://leetcode.cn/problems/parallel-courses) [🔗](https://leetcode.com/problems/parallel-courses) |
147+
| 1136 | 并行课程 🔒 | | [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) | 🟠 | [🀄️](https://leetcode.cn/problems/parallel-courses) [🔗](https://leetcode.com/problems/parallel-courses) |

‎src/.vuepress/sidebar.ts

+11-1
Original file line numberDiff line numberDiff line change
@@ -290,6 +290,7 @@ export default sidebar({
290290
"0322",
291291
"0326",
292292
"0328",
293+
"0329",
293294
"0331",
294295
"0334",
295296
"0337",
@@ -394,6 +395,8 @@ export default sidebar({
394395
"0461",
395396
"0462",
396397
"0463",
398+
"0464",
399+
"0467",
397400
"0474",
398401
"0476",
399402
"0482",
@@ -460,6 +463,7 @@ export default sidebar({
460463
"0628",
461464
"0632",
462465
"0637",
466+
"0638",
463467
"0641",
464468
"0643",
465469
"0645",
@@ -551,6 +555,7 @@ export default sidebar({
551555
"0867",
552556
"0868",
553557
"0872",
558+
"0873",
554559
"0875",
555560
"0876",
556561
"0880",
@@ -637,7 +642,8 @@ export default sidebar({
637642
"1078",
638643
"1079",
639644
"1081",
640-
"1089"
645+
"1089",
646+
"1092"
641647
]
642648
},
643649
{
@@ -976,6 +982,7 @@ export default sidebar({
976982
"2148",
977983
"2154",
978984
"2160",
985+
"2161",
979986
"2164",
980987
"2169",
981988
"2176",
@@ -1066,6 +1073,7 @@ export default sidebar({
10661073
"2425",
10671074
"2429",
10681075
"2458",
1076+
"2460",
10691077
"2461",
10701078
"2462",
10711079
"2463",
@@ -1089,6 +1097,7 @@ export default sidebar({
10891097
"2558",
10901098
"2559",
10911099
"2563",
1100+
"2570",
10921101
"2577",
10931102
"2583",
10941103
"2593"
@@ -1173,6 +1182,7 @@ export default sidebar({
11731182
"2776",
11741183
"2777",
11751184
"2779",
1185+
"2787",
11761186
"2794",
11771187
"2795",
11781188
"2796",

‎src/book/dynamic_programming.md

+5-5
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@
5959
| 403 | 青蛙过河 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/frog-jump) [🔗](https://leetcode.com/problems/frog-jump) |
6060
| 552 | 学生出勤记录 II | | [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/student-attendance-record-ii) [🔗](https://leetcode.com/problems/student-attendance-record-ii) |
6161
| 913 | 猫和老鼠 | | [`图`](/tag/graph.md) [`拓扑排序`](/tag/topological-sort.md) [`记忆化搜索`](/tag/memoization.md) `3+` | 🔴 | [🀄️](https://leetcode.cn/problems/cat-and-mouse) [🔗](https://leetcode.com/problems/cat-and-mouse) |
62-
| 329 | 矩阵中的最长递增路径 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) |
62+
| 329 | 矩阵中的最长递增路径 | [[✓]](/problem/0329.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) |
6363

6464
#### 线性 DP
6565

@@ -78,7 +78,7 @@
7878
| 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) |
7979
| 740 | 删除并获得点数 | [[✓]](/problem/0740.md) | [`数组`](/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) |
8080
| 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) |
81-
| 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) |
81+
| 873 | 最长的斐波那契子序列的长度 | [[✓]](/problem/0873.md) | [`数组`](/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) |
8282
| 1027 | 最长等差数列 | [[✓]](/problem/1027.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/longest-arithmetic-subsequence) [🔗](https://leetcode.com/problems/longest-arithmetic-subsequence) |
8383
| 1055 | 形成字符串的最短路径 🔒 | | [`贪心`](/tag/greedy.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/shortest-way-to-form-string) [🔗](https://leetcode.com/problems/shortest-way-to-form-string) |
8484
| 368 | 最大整除子集 | [[✓]](/problem/0368.md) | [`数组`](/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) |
@@ -177,7 +177,7 @@
177177
| 518 | 零钱兑换 II | [[✓]](/problem/0518.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/coin-change-ii) [🔗](https://leetcode.com/problems/coin-change-ii) |
178178
| 139 | 单词拆分 | [[✓]](/problem/0139.md) | [`字典树`](/tag/trie.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/word-break) [🔗](https://leetcode.com/problems/word-break) |
179179
| 377 | 组合总和 Ⅳ | [[✓]](/problem/0377.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/combination-sum-iv) [🔗](https://leetcode.com/problems/combination-sum-iv) |
180-
| 638 | 大礼包 | | [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
180+
| 638 | 大礼包 | [[✓]](/problem/0638.md) | [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
181181
| 1449 | 数位成本和为目标值的最大数字 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/form-largest-integer-with-digits-that-add-up-to-target) [🔗](https://leetcode.com/problems/form-largest-integer-with-digits-that-add-up-to-target) |
182182

183183
* 多重背包问题
@@ -268,9 +268,9 @@
268268
| 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) |
269269
| 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) |
270270
| 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) |
271-
| 464 | 我能赢吗 | | [`位运算`](/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) |
271+
| 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) |
272272
| 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) |
273-
| 638 | 大礼包 | | [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
273+
| 638 | 大礼包 | [[✓]](/problem/0638.md) | [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/shopping-offers) [🔗](https://leetcode.com/problems/shopping-offers) |
274274
| 1994 | 好子集的数目 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`数学`](/tag/math.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/the-number-of-good-subsets) [🔗](https://leetcode.com/problems/the-number-of-good-subsets) |
275275
| 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) |
276276
| 698 | 划分为k个相等的子集 | | [`位运算`](/tag/bit-manipulation.md) [`记忆化搜索`](/tag/memoization.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/partition-to-k-equal-sum-subsets) [🔗](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) |

‎src/book/slide_window.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -590,6 +590,6 @@ var lengthOfLongestSubstring = function (s) {
590590
| 713 | 乘积小于 K 的子数组 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/subarray-product-less-than-k) [🔗](https://leetcode.com/problems/subarray-product-less-than-k) |
591591
| 904 | 水果成篮 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/fruit-into-baskets) [🔗](https://leetcode.com/problems/fruit-into-baskets) |
592592
| 1358 | 包含所有三种字符的子字符串数目 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |
593-
| 467 | 环绕字符串中唯一的子字符串 | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/unique-substrings-in-wraparound-string) [🔗](https://leetcode.com/problems/unique-substrings-in-wraparound-string) |
593+
| 467 | 环绕字符串中唯一的子字符串 | [[✓]](/problem/0467.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/unique-substrings-in-wraparound-string) [🔗](https://leetcode.com/problems/unique-substrings-in-wraparound-string) |
594594
| 1438 | 绝对差不超过限制的最长连续子数组 | | [`队列`](/tag/queue.md) [`数组`](/tag/array.md) [`有序集合`](/tag/ordered-set.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) [🔗](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
595595

‎src/plan/codetop_list.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -159,7 +159,7 @@ headerDepth: 0
159159
| 384 | 打乱数组 | [[✓]](/problem/0384.md) | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`随机化`](/tag/randomized.md) | 🟠 | [🀄️](https://leetcode.cn/problems/shuffle-an-array) [🔗](https://leetcode.com/problems/shuffle-an-array) | 28 |
160160
| 328 | 奇偶链表 | [[✓]](/problem/0328.md) | [`链表`](/tag/linked-list.md) | 🟠 | [🀄️](https://leetcode.cn/problems/odd-even-linked-list) [🔗](https://leetcode.com/problems/odd-even-linked-list) | 28 |
161161
| 91 | 解码方法 | [[✓]](/problem/0091.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/decode-ways) [🔗](https://leetcode.com/problems/decode-ways) | 28 |
162-
| 329 | 矩阵中的最长递增路径 | | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 28 |
162+
| 329 | 矩阵中的最长递增路径 | [[✓]](/problem/0329.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [`图`](/tag/graph.md) `5+` | 🔴 | [🀄️](https://leetcode.cn/problems/longest-increasing-path-in-a-matrix) [🔗](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | 28 |
163163
| 208 | 实现 Trie (前缀树) | [[✓]](/problem/0208.md) | [`设计`](/tag/design.md) [`字典树`](/tag/trie.md) [`哈希表`](/tag/hash-table.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/implement-trie-prefix-tree) [🔗](https://leetcode.com/problems/implement-trie-prefix-tree) | 27 |
164164
| 9 | 回文数 | [[✓]](/problem/0009.md) | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/palindrome-number) [🔗](https://leetcode.com/problems/palindrome-number) | 27 |
165165
| 10 | 正则表达式匹配 | [[✓]](/problem/0010.md) | [`递归`](/tag/recursion.md) [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/regular-expression-matching) [🔗](https://leetcode.com/problems/regular-expression-matching) | 26 |

0 commit comments

Comments
 (0)