@@ -64,7 +64,7 @@ headerDepth: 0
64
64
| 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 |
65
65
| 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 |
66
66
| 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 |
68
68
| 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 |
69
69
| 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 |
70
70
| 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
139
139
| 剑指 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 |
140
140
| 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 |
141
141
| 剑指 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 |
143
143
| 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 |
144
144
| 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 |
145
145
| 剑指 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
201
201
| 0443 | [ 压缩字符串] ( https://leetcode.com/problems/string-compression/ ) | | [ ` 双指针 ` ] ( /leetcode/outline/tag/two-pointers.md ) [ ` 字符串 ` ] ( /leetcode/outline/tag/string.md ) | <font color =#ffb800 >Medium</font > | 18 |
202
202
| 剑指 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 |
203
203
| 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 |
205
205
| 剑指 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 |
206
206
| 剑指 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 |
207
207
| 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 |
0 commit comments