Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit 40f8a6d

Browse filesBrowse files
committed
add some soutions
1 parent 0f56ecc commit 40f8a6d
Copy full SHA for 40f8a6d

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
Dismiss banner
Expand file treeCollapse file tree

68 files changed

+4502
-105
lines changed

‎src/.vuepress/sidebar.ts

Copy file name to clipboardExpand all lines: src/.vuepress/sidebar.ts
+26-2Lines changed: 26 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -174,17 +174,23 @@ export default sidebar({
174174
"0160",
175175
"0162",
176176
"0167",
177+
"0168",
177178
"0169",
178179
"0170",
180+
"0171",
179181
"0172",
180182
"0173",
181183
"0174",
184+
"0175",
182185
"0177",
186+
"0181",
187+
"0182",
183188
"0183",
184189
"0188",
185190
"0189",
186191
"0190",
187192
"0191",
193+
"0193",
188194
"0198",
189195
"0199"
190196
]
@@ -217,6 +223,7 @@ export default sidebar({
217223
"0227",
218224
"0228",
219225
"0230",
226+
"0231",
220227
"0232",
221228
"0233",
222229
"0234",
@@ -228,7 +235,9 @@ export default sidebar({
228235
"0240",
229236
"0242",
230237
"0257",
238+
"0258",
231239
"0259",
240+
"0263",
232241
"0264",
233242
"0268",
234243
"0274",
@@ -239,6 +248,7 @@ export default sidebar({
239248
"0287",
240249
"0289",
241250
"0290",
251+
"0292",
242252
"0295",
243253
"0297"
244254
]
@@ -253,14 +263,18 @@ export default sidebar({
253263
"0309",
254264
"0316",
255265
"0322",
266+
"0326",
256267
"0328",
257268
"0334",
258269
"0338",
270+
"0342",
259271
"0343",
260272
"0344",
261273
"0345",
262274
"0346",
263275
"0347",
276+
"0349",
277+
"0350",
264278
"0354",
265279
"0355",
266280
"0366",
@@ -274,6 +288,8 @@ export default sidebar({
274288
"0380",
275289
"0382",
276290
"0383",
291+
"0387",
292+
"0389",
277293
"0392",
278294
"0394",
279295
"0399"
@@ -334,6 +350,7 @@ export default sidebar({
334350
"0567",
335351
"0572",
336352
"0583",
353+
"0584",
337354
"0589",
338355
"0590",
339356
"0595"
@@ -394,6 +411,7 @@ export default sidebar({
394411
"collapsible": true,
395412
"children": [
396413
"0841",
414+
"0843",
397415
"0844",
398416
"0845",
399417
"0852",
@@ -436,6 +454,7 @@ export default sidebar({
436454
"1021",
437455
"1047",
438456
"1049",
457+
"1068",
439458
"1071",
440459
"1072",
441460
"1081"
@@ -475,6 +494,7 @@ export default sidebar({
475494
"1346",
476495
"1351",
477496
"1372",
497+
"1378",
478498
"1381"
479499
]
480500
},
@@ -492,6 +512,7 @@ export default sidebar({
492512
"1466",
493513
"1472",
494514
"1475",
515+
"1492",
495516
"1493",
496517
"1497",
497518
"1498"
@@ -530,7 +551,8 @@ export default sidebar({
530551
"1732",
531552
"1757",
532553
"1760",
533-
"1768"
554+
"1768",
555+
"1792"
534556
]
535557
},
536558
{
@@ -604,6 +626,7 @@ export default sidebar({
604626
"text": "2400-2499",
605627
"collapsible": true,
606628
"children": [
629+
"2405",
607630
"2406",
608631
"2416",
609632
"2458",
@@ -769,7 +792,8 @@ export default sidebar({
769792
"text": "3200-3299",
770793
"collapsible": true,
771794
"children": [
772-
"3243"
795+
"3243",
796+
"3264"
773797
]
774798
},
775799
{

‎src/book/binary_search.md

Copy file name to clipboardExpand all lines: src/book/binary_search.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -252,8 +252,8 @@ function bsearch(arr, value) {
252252
| 658 | 找到 K 个最接近的元素 | [[]](/problem/0658.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-k-closest-elements) [🔗](https://leetcode.com/problems/find-k-closest-elements) |
253253
| 270 | 最接近的二叉搜索树值 🔒 | | [``](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉搜索树`](/tag/binary-search-tree.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/closest-binary-search-tree-value) [🔗](https://leetcode.com/problems/closest-binary-search-tree-value) |
254254
| 702 | 搜索长度未知的有序数组 🔒 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`交互`](/tag/interactive.md) | 🟠 | [🀄️](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size) [🔗](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) |
255-
| 349 | 两个数组的交集 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) |
256-
| 350 | 两个数组的交集 II | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
255+
| 349 | 两个数组的交集 | [[]](/problem/0349.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) |
256+
| 350 | 两个数组的交集 II | [[]](/problem/0350.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
257257
| 287 | 寻找重复数 | [[]](/problem/0287.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-duplicate-number) [🔗](https://leetcode.com/problems/find-the-duplicate-number) |
258258
| 719 | 找出第 K 小的数对距离 | | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-k-th-smallest-pair-distance) [🔗](https://leetcode.com/problems/find-k-th-smallest-pair-distance) |
259259
| 259 | 较小的三数之和 🔒 | [[]](/problem/0259.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/3sum-smaller) [🔗](https://leetcode.com/problems/3sum-smaller) |

‎src/book/hash.md

Copy file name to clipboardExpand all lines: src/book/hash.md
+3-3Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -661,8 +661,8 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
661661
| 1941 | 检查是否所有字符出现次数相同 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences) [🔗](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences) |
662662
| 136 | 只出现一次的数字 | [[]](/problem/0136.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) |
663663
| 383 | 赎金信 | [[]](/problem/0383.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/ransom-note) [🔗](https://leetcode.com/problems/ransom-note) |
664-
| 349 | 两个数组的交集 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) |
665-
| 350 | 两个数组的交集 II | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
664+
| 349 | 两个数组的交集 | [[]](/problem/0349.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) |
665+
| 350 | 两个数组的交集 II | [[]](/problem/0350.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
666666
| 36 | 有效的数独 | [[]](/problem/0036.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/valid-sudoku) [🔗](https://leetcode.com/problems/valid-sudoku) |
667667
| 1 | 两数之和 | [[]](/problem/0001.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum) [🔗](https://leetcode.com/problems/two-sum) |
668668
| 15 | 三数之和 | [[]](/problem/0015.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/3sum) [🔗](https://leetcode.com/problems/3sum) |
@@ -680,7 +680,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
680680
| 451 | 根据字符出现频率排序 | [[]](/problem/0451.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`桶排序`](/tag/bucket-sort.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/sort-characters-by-frequency) [🔗](https://leetcode.com/problems/sort-characters-by-frequency) |
681681
| 49 | 字母异位词分组 | [[]](/problem/0049.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/group-anagrams) [🔗](https://leetcode.com/problems/group-anagrams) |
682682
| 599 | 两个列表的最小索引总和 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-index-sum-of-two-lists) [🔗](https://leetcode.com/problems/minimum-index-sum-of-two-lists) |
683-
| 387 | 字符串中的第一个唯一字符 | | [`队列`](/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) |
683+
| 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) |
684684
| 447 | 回旋镖的数量 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-boomerangs) [🔗](https://leetcode.com/problems/number-of-boomerangs) |
685685
| 149 | 直线上最多的点数 | [[]](/problem/0149.md) | [`几何`](/tag/geometry.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/max-points-on-a-line) [🔗](https://leetcode.com/problems/max-points-on-a-line) |
686686
| 359 | 日志速率限制器 🔒 | | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`数据流`](/tag/data-stream.md) | 🟢 | [🀄️](https://leetcode.cn/problems/logger-rate-limiter) [🔗](https://leetcode.com/problems/logger-rate-limiter) |

‎src/book/two_pointer.md

Copy file name to clipboardExpand all lines: src/book/two_pointer.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -70,7 +70,7 @@
7070
<!-- prettier-ignore -->
7171
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
7272
| :------: | :------ | :------: | :------ | :------: | :------: |
73-
| 350 | 两个数组的交集 II | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
73+
| 350 | 两个数组的交集 II | [[]](/problem/0350.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays-ii) [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii) |
7474
| 925 | 长按键入 | | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/long-pressed-name) [🔗](https://leetcode.com/problems/long-pressed-name) |
7575
| 844 | 比较含退格的字符串 | [[]](/problem/0844.md) | [``](/tag/stack.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/backspace-string-compare) [🔗](https://leetcode.com/problems/backspace-string-compare) |
7676
| 1229 | 安排会议日程 🔒 | | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/meeting-scheduler) [🔗](https://leetcode.com/problems/meeting-scheduler) |

‎src/plan/codetop_list.md

Copy file name to clipboardExpand all lines: src/plan/codetop_list.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -175,7 +175,7 @@ headerDepth: 0
175175
| 120 | 三角形最小路径和 | [[]](/problem/0120.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/triangle) [🔗](https://leetcode.com/problems/triangle) | 23 |
176176
| 400 | 第 N 位数字 | [[]](/problem/0400.md) | [`数学`](/tag/math.md) [`二分查找`](/tag/binary-search.md) | 🟠 | [🀄️](https://leetcode.cn/problems/nth-digit) [🔗](https://leetcode.com/problems/nth-digit) | 23 |
177177
| 1004 | 最大连续1的个数 III | [[]](/problem/1004.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`前缀和`](/tag/prefix-sum.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/max-consecutive-ones-iii) [🔗](https://leetcode.com/problems/max-consecutive-ones-iii) | 22 |
178-
| 349 | 两个数组的交集 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) | 22 |
178+
| 349 | 两个数组的交集 | [[]](/problem/0349.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) | 22 |
179179
| 剑指 Offer 61 | 扑克牌中的顺子 | [[]](/offer/jz_offer_61_1.md) | [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/bu-ke-pai-zhong-de-shun-zi-lcof) | 21 |
180180
| 85 | 最大矩形 | [[]](/problem/0085.md) | [``](/tag/stack.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/maximal-rectangle) [🔗](https://leetcode.com/problems/maximal-rectangle) | 21 |
181181
| 1047 | 删除字符串中的所有相邻重复项 | [[]](/problem/1047.md) | [``](/tag/stack.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string) [🔗](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string) | 21 |
@@ -189,7 +189,7 @@ headerDepth: 0
189189
| 611 | 有效三角形的个数 | [[]](/problem/0611.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/valid-triangle-number) [🔗](https://leetcode.com/problems/valid-triangle-number) | 20 |
190190
| 134 | 加油站 | [[]](/problem/0134.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) | 🟠 | [🀄️](https://leetcode.cn/problems/gas-station) [🔗](https://leetcode.com/problems/gas-station) | 20 |
191191
| 剑指 Offer 39 | 数组中出现次数超过一半的数字 | [[]](/offer/jz_offer_39_1.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`分治`](/tag/divide-and-conquer.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof) | 20 |
192-
| 168 | Excel 表列名称 | | [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/excel-sheet-column-title) [🔗](https://leetcode.com/problems/excel-sheet-column-title) | 20 |
192+
| 168 | Excel 表列名称 | [[]](/problem/0168.md) | [`数学`](/tag/math.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/excel-sheet-column-title) [🔗](https://leetcode.com/problems/excel-sheet-column-title) | 20 |
193193
| 44 | 通配符匹配 | [[]](/problem/0044.md) | [`贪心`](/tag/greedy.md) [`递归`](/tag/recursion.md) [`字符串`](/tag/string.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/wildcard-matching) [🔗](https://leetcode.com/problems/wildcard-matching) | 19 |
194194
| 556 | 下一个更大元素 III | | [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/next-greater-element-iii) [🔗](https://leetcode.com/problems/next-greater-element-iii) | 19 |
195195
| 210 | 课程表 II | [[]](/problem/0210.md) | [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) [``](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/course-schedule-ii) [🔗](https://leetcode.com/problems/course-schedule-ii) | 19 |

‎src/plan/company_list.md

Copy file name to clipboardExpand all lines: src/plan/company_list.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -180,7 +180,7 @@ headerDepth: 0
180180
| 295 | 数据流的中位数 | [[]](/problem/0295.md) | [`设计`](/tag/design.md) [`双指针`](/tag/two-pointers.md) [`数据流`](/tag/data-stream.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/find-median-from-data-stream) [🔗](https://leetcode.com/problems/find-median-from-data-stream) | 4 |
181181
| 348 | 设计井字棋 🔒 | | [`设计`](/tag/design.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/design-tic-tac-toe) [🔗](https://leetcode.com/problems/design-tic-tac-toe) | 4 |
182182
| 799 | 香槟塔 | | [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/champagne-tower) [🔗](https://leetcode.com/problems/champagne-tower) | 3 |
183-
| 387 | 字符串中的第一个唯一字符 | | [`队列`](/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 |
183+
| 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 |
184184
| 155 | 最小栈 | [[]](/problem/0155.md) | [``](/tag/stack.md) [`设计`](/tag/design.md) | 🟠 | [🀄️](https://leetcode.cn/problems/min-stack) [🔗](https://leetcode.com/problems/min-stack) | 3 |
185185
| 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 |
186186
| 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 |

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.