|
1 | 1 | # 1.3 LeetCode 题解 |
2 | 2 |
|
3 | | -已完成 384 道 |
| 3 | +已完成 386 道 |
4 | 4 |
|
5 | 5 | | 题号 | 标题 | 题解 | 标签 | 难度 | |
6 | 6 | | :------: | :------ | :------: | :------ | :------ | |
|
76 | 76 | | 72 | [编辑距离](https://leetcode.com/problems/edit-distance) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0072) | [`字符串`](/leetcode/outline/tag/string.md) [`动态规划`](/leetcode/outline/tag/dynamic-programming.md) | <font color=#ffb800>Medium</font> | |
77 | 77 | | 73 | [矩阵置零](https://leetcode.com/problems/set-matrix-zeroes) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0073) | [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> | |
78 | 78 | | 74 | [搜索二维矩阵](https://leetcode.com/problems/search-a-2d-matrix) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0074) | [`数组`](/leetcode/outline/tag/array.md) [`二分查找`](/leetcode/outline/tag/binary-search.md) [`矩阵`](/leetcode/outline/tag/matrix.md) | <font color=#ffb800>Medium</font> | |
| 79 | +| 75 | [颜色分类](https://leetcode.com/problems/sort-colors) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0075) | [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) [`排序`](/leetcode/outline/tag/sorting.md) | <font color=#ffb800>Medium</font> | |
79 | 80 | | 76 | [最小覆盖子串](https://leetcode.com/problems/minimum-window-substring) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0076) | [`哈希表`](/leetcode/outline/tag/hash-table.md) [`字符串`](/leetcode/outline/tag/string.md) [`滑动窗口`](/leetcode/outline/tag/sliding-window.md) | <font color=#ff334b>Hard</font> | |
80 | 81 | | 77 | [组合](https://leetcode.com/problems/combinations) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0077) | [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> | |
81 | 82 | | 78 | [子集](https://leetcode.com/problems/subsets) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0078) | [`位运算`](/leetcode/outline/tag/bit-manipulation.md) [`数组`](/leetcode/outline/tag/array.md) [`回溯`](/leetcode/outline/tag/backtracking.md) | <font color=#ffb800>Medium</font> | |
|
301 | 302 | | 946 | [验证栈序列](https://leetcode.com/problems/validate-stack-sequences) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0946) | [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`模拟`](/leetcode/outline/tag/simulation.md) | <font color=#ffb800>Medium</font> | |
302 | 303 | | 954 | [二倍数对数组](https://leetcode.com/problems/array-of-doubled-pairs) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0954) | [`贪心`](/leetcode/outline/tag/greedy.md) [`数组`](/leetcode/outline/tag/array.md) [`哈希表`](/leetcode/outline/tag/hash-table.md) `1+` | <font color=#ffb800>Medium</font> | |
303 | 304 | | 958 | [二叉树的完全性检验](https://leetcode.com/problems/check-completeness-of-a-binary-tree) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0958) | [`树`](/leetcode/outline/tag/tree.md) [`广度优先搜索`](/leetcode/outline/tag/breadth-first-search.md) [`二叉树`](/leetcode/outline/tag/binary-tree.md) | <font color=#ffb800>Medium</font> | |
| 305 | +| 962 | [最大宽度坡](https://leetcode.com/problems/maximum-width-ramp) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0962) | [`栈`](/leetcode/outline/tag/stack.md) [`数组`](/leetcode/outline/tag/array.md) [`单调栈`](/leetcode/outline/tag/monotonic-stack.md) | <font color=#ffb800>Medium</font> | |
304 | 306 | | 973 | [最接近原点的 K 个点](https://leetcode.com/problems/k-closest-points-to-origin) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0973) | [`几何`](/leetcode/outline/tag/geometry.md) [`数组`](/leetcode/outline/tag/array.md) [`数学`](/leetcode/outline/tag/math.md) `4+` | <font color=#ffb800>Medium</font> | |
305 | 307 | | 986 | [区间列表的交集](https://leetcode.com/problems/interval-list-intersections) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/0986) | [`数组`](/leetcode/outline/tag/array.md) [`双指针`](/leetcode/outline/tag/two-pointers.md) | <font color=#ffb800>Medium</font> | |
306 | 308 | | 1008 | [前序遍历构造二叉搜索树](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal) | [[✓]](https://2xiao.github.io/leetcode-js/leetcode/problem/1008) | [`栈`](/leetcode/outline/tag/stack.md) [`树`](/leetcode/outline/tag/tree.md) [`二叉搜索树`](/leetcode/outline/tag/binary-search-tree.md) `3+` | <font color=#ffb800>Medium</font> | |
|
0 commit comments