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
Sign up
Appearance settings

Commit 5fa2051

Browse files
committed
Deploying to main from @ 7ab0a22 🚀
1 parent df3af26 commit 5fa2051

Some content is hidden

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

45 files changed

+2547
-64
lines changed

‎book/backtracking.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -710,7 +710,7 @@ var permuteRepeat = function (nums) {
710710
| 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) |
711711
| 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) |
712712
| 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) |
713-
| 1079 | 活字印刷 | | [`哈希表`](/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) |
713+
| 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) |
714714
| 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) |
715715
| 79 | 单词搜索 | [[✓]](/problem/0079.md) | [`数组`](/tag/array.md) [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/word-search) [🔗](https://leetcode.com/problems/word-search) |
716716
| 679 | 24 点游戏 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🔴 | [🀄️](https://leetcode.cn/problems/24-game) [🔗](https://leetcode.com/problems/24-game) |

‎book/hash.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -667,7 +667,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
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) |
669669
| 18 | 四数之和 | [[✓]](/problem/0018.md) | [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`排序`](/tag/sorting.md) | 🟠 | [🀄️](https://leetcode.cn/problems/4sum) [🔗](https://leetcode.com/problems/4sum) |
670-
| 454 | 四数相加 II | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/4sum-ii) [🔗](https://leetcode.com/problems/4sum-ii) |
670+
| 454 | 四数相加 II | [[✓]](/problem/0454.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/4sum-ii) [🔗](https://leetcode.com/problems/4sum-ii) |
671671
| 41 | 缺失的第一个正数 | [[✓]](/problem/0041.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🔴 | [🀄️](https://leetcode.cn/problems/first-missing-positive) [🔗](https://leetcode.com/problems/first-missing-positive) |
672672
| 128 | 最长连续序列 | [[✓]](/problem/0128.md) | [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-consecutive-sequence) [🔗](https://leetcode.com/problems/longest-consecutive-sequence) |
673673
| 202 | 快乐数 | [[✓]](/problem/0202.md) | [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) | 🟢 | [🀄️](https://leetcode.cn/problems/happy-number) [🔗](https://leetcode.com/problems/happy-number) |
@@ -681,7 +681,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
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 | 两个列表的最小索引总和 | [[✓]](/problem/0599.md) | [`数组`](/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) |
683683
| 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) |
684-
| 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) |
684+
| 447 | 回旋镖的数量 | [[✓]](/problem/0447.md) | [`数组`](/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) |
687687
| 811 | 子域名访问计数 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/subdomain-visit-count) [🔗](https://leetcode.com/problems/subdomain-visit-count) |

‎plan/contest_list.md

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1345,7 +1345,7 @@ headerDepth: 0
13451345
| :------: | :------ | :------: | :------ | :------: | :------: |
13461346
| 2696 | 删除子串后的字符串最小长度 | [[✓]](/problem/2696.md) | [`栈`](/tag/stack.md) [`字符串`](/tag/string.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-string-length-after-removing-substrings) [🔗](https://leetcode.com/problems/minimum-string-length-after-removing-substrings) |
13471347
| 2697 | 字典序最小回文串 | | [`贪心`](/tag/greedy.md) [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/lexicographically-smallest-palindrome) [🔗](https://leetcode.com/problems/lexicographically-smallest-palindrome) |
1348-
| 2698 | 求一个整数的惩罚数 | | [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-punishment-number-of-an-integer) [🔗](https://leetcode.com/problems/find-the-punishment-number-of-an-integer) |
1348+
| 2698 | 求一个整数的惩罚数 | [[✓]](/problem/2698.md) | [`数学`](/tag/math.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-punishment-number-of-an-integer) [🔗](https://leetcode.com/problems/find-the-punishment-number-of-an-integer) |
13491349
| 2699 | 修改图中的边权 | | [`图`](/tag/graph.md) [`最短路`](/tag/shortest-path.md) [`堆(优先队列)`](/tag/heap-priority-queue.md) | 🔴 | [🀄️](https://leetcode.cn/problems/modify-graph-edge-weights) [🔗](https://leetcode.com/problems/modify-graph-edge-weights) |
13501350

13511351

@@ -2065,7 +2065,7 @@ headerDepth: 0
20652065
| :------: | :------ | :------: | :------ | :------: | :------: |
20662066
| 2373 | 矩阵中的局部最大值 | [[✓]](/problem/2373.md) | [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🟢 | [🀄️](https://leetcode.cn/problems/largest-local-values-in-a-matrix) [🔗](https://leetcode.com/problems/largest-local-values-in-a-matrix) |
20672067
| 2374 | 边积分最高的节点 | | [`图`](/tag/graph.md) [`哈希表`](/tag/hash-table.md) | 🟠 | [🀄️](https://leetcode.cn/problems/node-with-highest-edge-score) [🔗](https://leetcode.com/problems/node-with-highest-edge-score) |
2068-
| 2375 | 根据模式串构造最小数字 | | [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/construct-smallest-number-from-di-string) [🔗](https://leetcode.com/problems/construct-smallest-number-from-di-string) |
2068+
| 2375 | 根据模式串构造最小数字 | [[✓]](/problem/2375.md) | [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/construct-smallest-number-from-di-string) [🔗](https://leetcode.com/problems/construct-smallest-number-from-di-string) |
20692069
| 2376 | 统计特殊整数 | | [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/count-special-integers) [🔗](https://leetcode.com/problems/count-special-integers) |
20702070

20712071

@@ -2976,7 +2976,7 @@ headerDepth: 0
29762976
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
29772977
| :------: | :------ | :------: | :------ | :------: | :------: |
29782978
| 1979 | 找出数组的最大公约数 | [[✓]](/problem/1979.md) | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`数论`](/tag/number-theory.md) | 🟢 | [🀄️](https://leetcode.cn/problems/find-greatest-common-divisor-of-array) [🔗](https://leetcode.com/problems/find-greatest-common-divisor-of-array) |
2979-
| 1980 | 找出不同的二进制字符串 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-unique-binary-string) [🔗](https://leetcode.com/problems/find-unique-binary-string) |
2979+
| 1980 | 找出不同的二进制字符串 | [[✓]](/problem/1980.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-unique-binary-string) [🔗](https://leetcode.com/problems/find-unique-binary-string) |
29802980
| 1981 | 最小化目标值与所选元素的差 | | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`矩阵`](/tag/matrix.md) | 🟠 | [🀄️](https://leetcode.cn/problems/minimize-the-difference-between-target-and-chosen-elements) [🔗](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements) |
29812981
| 1982 | 从子集的和还原数组 | | [`数组`](/tag/array.md) [`分治`](/tag/divide-and-conquer.md) | 🔴 | [🀄️](https://leetcode.cn/problems/find-array-given-subset-sums) [🔗](https://leetcode.com/problems/find-array-given-subset-sums) |
29822982

@@ -3565,7 +3565,7 @@ headerDepth: 0
35653565
| :------: | :------ | :------: | :------ | :------: | :------: |
35663566
| 1716 | 计算力扣银行的钱 | [[✓]](/problem/1716.md) | [`数学`](/tag/math.md) | 🟢 | [🀄️](https://leetcode.cn/problems/calculate-money-in-leetcode-bank) [🔗](https://leetcode.com/problems/calculate-money-in-leetcode-bank) |
35673567
| 1717 | 删除子字符串的最大得分 | | [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-score-from-removing-substrings) [🔗](https://leetcode.com/problems/maximum-score-from-removing-substrings) |
3568-
| 1718 | 构建字典序最大的可行序列 | | [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/construct-the-lexicographically-largest-valid-sequence) [🔗](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence) |
3568+
| 1718 | 构建字典序最大的可行序列 | [[✓]](/problem/1718.md) | [`数组`](/tag/array.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/construct-the-lexicographically-largest-valid-sequence) [🔗](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence) |
35693569
| 1719 | 重构一棵树的方案数 | | [`树`](/tag/tree.md) [`图`](/tag/graph.md) | 🔴 | [🀄️](https://leetcode.cn/problems/number-of-ways-to-reconstruct-a-tree) [🔗](https://leetcode.com/problems/number-of-ways-to-reconstruct-a-tree) |
35703570

35713571

@@ -4249,7 +4249,7 @@ headerDepth: 0
42494249
| :------: | :------ | :------: | :------ | :------: | :------: |
42504250
| 1413 | 逐步求和得到正数的最小值 | [[✓]](/problem/1413.md) | [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟢 | [🀄️](https://leetcode.cn/problems/minimum-value-to-get-positive-step-by-step-sum) [🔗](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum) |
42514251
| 1414 | 和为 K 的最少斐波那契数字数目 | | [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k) [🔗](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k) |
4252-
| 1415 | 长度为 n 的开心字符串中字典序第 k 小的字符串 | | [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) [🔗](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
4252+
| 1415 | 长度为 n 的开心字符串中字典序第 k 小的字符串 | [[✓]](/problem/1415.md) | [`字符串`](/tag/string.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) [🔗](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
42534253
| 1416 | 恢复数组 | | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/restore-the-array) [🔗](https://leetcode.com/problems/restore-the-array) |
42544254

42554255

@@ -4404,7 +4404,7 @@ headerDepth: 0
44044404
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
44054405
| :------: | :------ | :------: | :------ | :------: | :------: |
44064406
| 1351 | 统计有序矩阵中的负数 | [[✓]](/problem/1351.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`矩阵`](/tag/matrix.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-negative-numbers-in-a-sorted-matrix) [🔗](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix) |
4407-
| 1352 | 最后 K 个数的乘积 | | [`设计`](/tag/design.md) [`队列`](/tag/queue.md) [`数组`](/tag/array.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/product-of-the-last-k-numbers) [🔗](https://leetcode.com/problems/product-of-the-last-k-numbers) |
4407+
| 1352 | 最后 K 个数的乘积 | [[✓]](/problem/1352.md) | [`设计`](/tag/design.md) [`队列`](/tag/queue.md) [`数组`](/tag/array.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/product-of-the-last-k-numbers) [🔗](https://leetcode.com/problems/product-of-the-last-k-numbers) |
44084408
| 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) |
44094409
| 1354 | 多次求和构造目标数组 | | [`数组`](/tag/array.md) [`堆(优先队列)`](/tag/heap-priority-queue.md) | 🔴 | [🀄️](https://leetcode.cn/problems/construct-target-array-with-multiple-sums) [🔗](https://leetcode.com/problems/construct-target-array-with-multiple-sums) |
44104410

@@ -4632,7 +4632,7 @@ headerDepth: 0
46324632
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
46334633
| :------: | :------ | :------: | :------ | :------: | :------: |
46344634
| 1260 | 二维网格迁移 | [[✓]](/problem/1260.md) | [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) [`模拟`](/tag/simulation.md) | 🟢 | [🀄️](https://leetcode.cn/problems/shift-2d-grid) [🔗](https://leetcode.com/problems/shift-2d-grid) |
4635-
| 1261 | 在受污染的二叉树中查找元素 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree) [🔗](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree) |
4635+
| 1261 | 在受污染的二叉树中查找元素 | [[✓]](/problem/1261.md) | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/find-elements-in-a-contaminated-binary-tree) [🔗](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree) |
46364636
| 1262 | 可被三整除的最大和 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/greatest-sum-divisible-by-three) [🔗](https://leetcode.com/problems/greatest-sum-divisible-by-three) |
46374637
| 1263 | 推箱子 | | [`广度优先搜索`](/tag/breadth-first-search.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-moves-to-move-a-box-to-their-target-location) [🔗](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location) |
46384638

@@ -5052,7 +5052,7 @@ headerDepth: 0
50525052
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
50535053
| :------: | :------ | :------: | :------ | :------: | :------: |
50545054
| 1078 | Bigram 分词 | [[✓]](/problem/1078.md) | [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/occurrences-after-bigram) [🔗](https://leetcode.com/problems/occurrences-after-bigram) |
5055-
| 1079 | 活字印刷 | | [`哈希表`](/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) |
5055+
| 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) |
50565056
| 1080 | 根到叶路径上的不足节点 | | [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`二叉树`](/tag/binary-tree.md) | 🟠 | [🀄️](https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths) [🔗](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths) |
50575057
| 1081 | 不同字符的最小子序列 | [[✓]](/problem/1081.md) | [`栈`](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/smallest-subsequence-of-distinct-characters) [🔗](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters) |
50585058

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /