Skip to content

Commit 6df3c0c

Browse files
committed
add 43 440 459 1590
1 parent bcb0be3 commit 6df3c0c

23 files changed

+536
-246
lines changed

assets/output/0043.md

Lines changed: 0 additions & 54 deletions
This file was deleted.

assets/output/0440.md

Lines changed: 0 additions & 47 deletions
This file was deleted.

assets/output/0459.md

Lines changed: 0 additions & 57 deletions
This file was deleted.

assets/output/1590.md

Lines changed: 0 additions & 66 deletions
This file was deleted.

src/.vuepress/sidebar.ts

Lines changed: 5 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -94,6 +94,7 @@ export default sidebar({
9494
"0040",
9595
"0041",
9696
"0042",
97+
"0043",
9798
"0044",
9899
"0045",
99100
"0046",
@@ -311,11 +312,13 @@ export default sidebar({
311312
"0432",
312313
"0433",
313314
"0438",
315+
"0440",
314316
"0442",
315317
"0445",
316318
"0450",
317319
"0451",
318320
"0452",
321+
"0459",
319322
"0474",
320323
"0485",
321324
"0494",
@@ -453,7 +456,8 @@ export default sidebar({
453456
text: "1500-1599",
454457
collapsible: true,
455458
children: [
456-
"1522"
459+
"1522",
460+
"1590"
457461
],
458462
},
459463
{

src/leetcode/ds/string.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -83,15 +83,15 @@ BF 算法的思想可以用一句话来概括:在主串中检查起始位置
8383
| 0049 | [字母异位词分组](https://leetcode.com/problems/group-anagrams/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0049) | [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |
8484
| 0415 | [字符串相加](https://leetcode.com/problems/add-strings/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0415) | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#15bd66>Easy</font> |
8585
| 0151 | [反转字符串中的单词](https://leetcode.com/problems/reverse-words-in-a-string/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0151) | [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#ffb800>Medium</font> |
86-
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> |
86+
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0043) | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> |
8787
| 0014 | [最长公共前缀](https://leetcode.com/problems/longest-common-prefix/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0014) | [`字典树`](/leetcode/outline/tag/trie.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#15bd66>Easy</font> |
8888

8989
#### 单模式串匹配
9090

9191
| 题号 | 标题 | 题解 | 标签 | 难度 |
9292
| :------: | :------ | :------: | :------ | :------ |
9393
| 0028 | [找出字符串中第一个匹配项的下标](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0028) | [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#ffb800>Medium</font> |
94-
| 0459 | [重复的子字符串](https://leetcode.com/problems/repeated-substring-pattern/) | | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> |
94+
| 0459 | [重复的子字符串](https://leetcode.com/problems/repeated-substring-pattern/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0459) | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> |
9595
| 0686 | [重复叠加字符串匹配](https://leetcode.com/problems/repeated-string-match/) | | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#ffb800>Medium</font> |
9696
| 1668 | [最大重复子字符串](https://leetcode.com/problems/maximum-repeating-substring/) | | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> |
9797
| 0796 | [旋转字符串](https://leetcode.com/problems/rotate-string/) | | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> |
@@ -113,5 +113,5 @@ BF 算法的思想可以用一句话来概括:在主串中检查起始位置
113113
| 0336 | [回文对](https://leetcode.com/problems/palindrome-pairs/) | | [`字典树`](/leetcode/outline/tag/trie.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ff334b>Hard</font> |
114114
| 1023 | [驼峰式匹配](https://leetcode.com/problems/camelcase-matching/) | | [`字典树`](/leetcode/outline/tag/trie.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |
115115
| 0676 | [实现一个魔法字典](https://leetcode.com/problems/implement-magic-dictionary/) | | [`设计`](/leetcode/outline/tag/design.md) [`字典树`](/leetcode/outline/tag/trie.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> |
116-
| 0440 | [字典序的第K小数字](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | | [`字典树`](/leetcode/outline/tag/trie.md) | <font color=#ff334b>Hard</font> |
116+
| 0440 | [字典序的第K小数字](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0440) | [`字典树`](/leetcode/outline/tag/trie.md) | <font color=#ff334b>Hard</font> |
117117

src/leetcode/outline/plan/codetop_list.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -64,7 +64,7 @@ headerDepth: 0
6464
| 0322 | [零钱兑换](https://leetcode.com/problems/coin-change/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0322) | [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 84 |
6565
| 0155 | [最小栈](https://leetcode.com/problems/min-stack/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0155) | [``](/leetcode/outline/tag/stack.md) [`设计`](/leetcode/outline/tag/design.md) | <font color=#ffb800>Medium</font> | 84 |
6666
| 0105 | [从前序与中序遍历序列构造二叉树](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0105) | [``](/leetcode/outline/tag/tree.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `2+` | <font color=#ffb800>Medium</font> | 84 |
67-
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | 82 |
67+
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0043) | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | 82 |
6868
| 0151 | [反转字符串中的单词](https://leetcode.com/problems/reverse-words-in-a-string/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0151) | [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#ffb800>Medium</font> | 81 |
6969
| 0032 | [最长有效括号](https://leetcode.com/problems/longest-valid-parentheses/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0032) | [``](/leetcode/outline/tag/stack.md) [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ff334b>Hard</font> | 81 |
7070
| 0144 | [二叉树的前序遍历](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0144) | [``](/leetcode/outline/tag/stack.md) [``](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) `1+` | <font color=#15bd66>Easy</font> | 78 |
@@ -139,7 +139,7 @@ headerDepth: 0
139139
| 剑指 Offer 42 | [连续子数组的最大和](https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_42_1) | [`数组`](/leetcode/outline/tag/array.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#15bd66>Easy</font> | 35 |
140140
| 0040 | [组合总和 II](https://leetcode.com/problems/combination-sum-ii/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0040) | [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> | 35 |
141141
| 剑指 Offer 04 | [二维数组中的查找](https://leetcode.cn/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_04_1) | [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`分治`](/leetcode/outline/tag/divide-and-conquer.md) `1+` | <font color=#ffb800>Medium</font> | 34 |
142-
| 0440 | [字典序的第K小数字](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | | [`字典树`](/leetcode/outline/tag/trie.md) | <font color=#ff334b>Hard</font> | 33 |
142+
| 0440 | [字典序的第K小数字](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0440) | [`字典树`](/leetcode/outline/tag/trie.md) | <font color=#ff334b>Hard</font> | 33 |
143143
| 0450 | [删除二叉搜索树中的节点](https://leetcode.com/problems/delete-node-in-a-bst/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0450) | [``](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> | 33 |
144144
| 0075 | [颜色分类](https://leetcode.com/problems/sort-colors/) | | [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> | 33 |
145145
| 剑指 Offer 10 - I | [斐波那契数列](https://leetcode.cn/problems/fei-bo-na-qi-shu-lie-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_10_1) | [`记忆化搜索`](/leetcode/outline/tag/memoization.md) [`数学`](/leetcode/outline/tag/mathematics.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#15bd66>Easy</font> | 33 |
@@ -201,7 +201,7 @@ headerDepth: 0
201201
| 0443 | [压缩字符串](https://leetcode.com/problems/string-compression/) | | [`双指针`](/leetcode/outline/tag/two-pointers.md) [`字符串`](/leetcode/outline/tag/string.md) | <font color=#ffb800>Medium</font> | 18 |
202202
| 剑指 Offer 45 | [把数组排成最小的数](https://leetcode.cn/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | | [`贪心`](/leetcode/outline/tag/greedy.md) [`字符串`](/leetcode/outline/tag/string.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> | 18 |
203203
| 0037 | [解数独](https://leetcode.com/problems/sudoku-solver/) | | [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`回溯`](/leetcode/outline/tag/backtracking.md) `1+` | <font color=#ff334b>Hard</font> | 18 |
204-
| 0459 | [重复的子字符串](https://leetcode.com/problems/repeated-substring-pattern/) | | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> | 18 |
204+
| 0459 | [重复的子字符串](https://leetcode.com/problems/repeated-substring-pattern/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0459) | [`字符串`](/leetcode/outline/tag/string.md) [`字符串匹配`](/leetcode/outline/tag/string-matching.md) | <font color=#15bd66>Easy</font> | 18 |
205205
| 剑指 Offer 34 | [二叉树中和为某一值的路径](https://leetcode.cn/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_34_1) | [``](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md) [`回溯`](/leetcode/outline/tag/backtracking.md) `1+` | <font color=#ffb800>Medium</font> | 18 |
206206
| 剑指 Offer 53 - I | [在排序数组中查找数字 I](https://leetcode.cn/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_53_1) | [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) | <font color=#15bd66>Easy</font> | 18 |
207207
| 0086 | [分隔链表](https://leetcode.com/problems/partition-list/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0086) | [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#ffb800>Medium</font> | 18 |

src/leetcode/outline/plan/company_list.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -260,7 +260,7 @@ headerDepth: 0
260260
| 0054 | [螺旋矩阵](https://leetcode.com/problems/spiral-matrix/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0054) | [`数组`](/leetcode/outline/tag/array.md) [`矩阵`](/leetcode/outline/tag/matrix.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | 13 |
261261
| 0322 | [零钱兑换](https://leetcode.com/problems/coin-change/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0322) | [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`数组`](/leetcode/outline/tag/array.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | 13 |
262262
| 剑指 Offer 22 | [链表中倒数第k个节点](https://leetcode.cn/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/jz_offer_22_1) | [`链表`](/leetcode/outline/tag/linked-list.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#15bd66>Easy</font> | 13 |
263-
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | 13 |
263+
| 0043 | [字符串相乘](https://leetcode.com/problems/multiply-strings/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0043) | [`数学`](/leetcode/outline/tag/mathematics.md) [`字符串`](/leetcode/outline/tag/string.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | 13 |
264264
| 0155 | [最小栈](https://leetcode.com/problems/min-stack/) | [JS](https://2xiao.github.io/leetcode-js/leetcode/problem/0155) | [``](/leetcode/outline/tag/stack.md) [`设计`](/leetcode/outline/tag/design.md) | <font color=#ffb800>Medium</font> | 12 |
265265

266266

0 commit comments

Comments
 (0)