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 04e9744

Browse files
committed
Deploying to main from @ 8ef5c14 🚀
1 parent 176a483 commit 04e9744

31 files changed

+373
-1786
lines changed

‎book/hash.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -647,6 +647,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
647647
<!-- Please keep comment here to allow auto update -->
648648
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
649649

650+
650651
## 相关题目
651652

652653
<!-- prettier-ignore -->
@@ -684,3 +685,4 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
684685
| 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) |
685686
| 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) |
686687
| 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) |
688+

‎book/linked_list.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1683,6 +1683,7 @@ x.next = p.next; // 将x的节点的next指针指向b节点;
16831683
<!-- Please keep comment here to allow auto update -->
16841684
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
16851685

1686+
16861687
## 相关题目
16871688

16881689
#### 链表基础题目
@@ -1727,3 +1728,4 @@ x.next = p.next; // 将x的节点的next指针指向b节点;
17271728
| 143 | 重排链表 | [[]](/problem/0143.md) | [``](/tag/stack.md) [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/reorder-list) [🔗](https://leetcode.com/problems/reorder-list) |
17281729
| 2 | 两数相加 | [[]](/problem/0002.md) | [`递归`](/tag/recursion.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers) [🔗](https://leetcode.com/problems/add-two-numbers) |
17291730
| 445 | 两数相加 II | [[]](/problem/0445.md) | [``](/tag/stack.md) [`链表`](/tag/linked-list.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/add-two-numbers-ii) [🔗](https://leetcode.com/problems/add-two-numbers-ii) |
1731+

‎book/queue.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -718,6 +718,7 @@ console.log(priorityQueue.count()); // output: 3
718718
<!-- Please keep comment here to allow auto update -->
719719
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
720720

721+
721722
## 相关题目
722723

723724
#### 队列基础题目
@@ -743,3 +744,4 @@ console.log(priorityQueue.count()); // output: 3
743744
| 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) |
744745
| 23 | 合并 K 个升序链表 | [[]](/problem/0023.md) | [`链表`](/tag/linked-list.md) [`分治`](/tag/divide-and-conquer.md) [`堆(优先队列)`](/tag/heap-priority-queue.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/merge-k-sorted-lists) [🔗](https://leetcode.com/problems/merge-k-sorted-lists) |
745746
| 218 | 天际线问题 | | [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/the-skyline-problem) [🔗](https://leetcode.com/problems/the-skyline-problem) |
747+

‎book/stack.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -619,6 +619,7 @@ var dailyTemperatures = function (temperatures) {
619619
<!-- Please keep comment here to allow auto update -->
620620
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
621621

622+
622623
## 相关题目
623624

624625
#### 栈基础题目
@@ -653,3 +654,4 @@ var dailyTemperatures = function (temperatures) {
653654
| 316 | 去除重复字母 | [[]](/problem/0316.md) | [``](/tag/stack.md) [`贪心`](/tag/greedy.md) [`字符串`](/tag/string.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/remove-duplicate-letters) [🔗](https://leetcode.com/problems/remove-duplicate-letters) |
654655
| 42 | 接雨水 | [[]](/problem/0042.md) | [``](/tag/stack.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/trapping-rain-water) [🔗](https://leetcode.com/problems/trapping-rain-water) |
655656
| 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) |
657+

‎book/tree.md

Lines changed: 6 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1047,6 +1047,7 @@ class NumArray {
10471047
<!-- Please keep comment here to allow auto update -->
10481048
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
10491049

1050+
10501051
## 相关题目
10511052

10521053
#### 二叉树的遍历
@@ -1106,7 +1107,7 @@ class NumArray {
11061107

11071108
#### 线段树
11081109

1109-
- 单点更新
1110+
* 单点更新
11101111

11111112
<!-- prettier-ignore -->
11121113
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1115,7 +1116,7 @@ class NumArray {
11151116
| 307 | 区域和检索 - 数组可修改 | [[]](/problem/0307.md) | [`设计`](/tag/design.md) [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/range-sum-query-mutable) [🔗](https://leetcode.com/problems/range-sum-query-mutable) |
11161117
| 354 | 俄罗斯套娃信封问题 | [[]](/problem/0354.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/russian-doll-envelopes) [🔗](https://leetcode.com/problems/russian-doll-envelopes) |
11171118

1118-
- 区间更新
1119+
* 区间更新
11191120

11201121
<!-- prettier-ignore -->
11211122
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1127,7 +1128,7 @@ class NumArray {
11271128
| 1310 | 子数组异或查询 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/xor-queries-of-a-subarray) [🔗](https://leetcode.com/problems/xor-queries-of-a-subarray) |
11281129
| 1851 | 包含每个查询的最小区间 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`排序`](/tag/sorting.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/minimum-interval-to-include-each-query) [🔗](https://leetcode.com/problems/minimum-interval-to-include-each-query) |
11291130

1130-
- 区间合并
1131+
* 区间合并
11311132

11321133
<!-- prettier-ignore -->
11331134
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1136,7 +1137,7 @@ class NumArray {
11361137
| 731 | 我的日程安排表 II | [[]](/problem/0731.md) | [`设计`](/tag/design.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `3+` | 🟠 | [🀄️](https://leetcode.cn/problems/my-calendar-ii) [🔗](https://leetcode.com/problems/my-calendar-ii) |
11371138
| 732 | 我的日程安排表 III | | [`设计`](/tag/design.md) [`线段树`](/tag/segment-tree.md) [`二分查找`](/tag/binary-search.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/my-calendar-iii) [🔗](https://leetcode.com/problems/my-calendar-iii) |
11381139

1139-
- 扫描线问题
1140+
* 扫描线问题
11401141

11411142
<!-- prettier-ignore -->
11421143
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1177,3 +1178,4 @@ class NumArray {
11771178
| 947 | 移除最多的同行或同列石头 | | [`深度优先搜索`](/tag/depth-first-search.md) [`并查集`](/tag/union-find.md) [``](/tag/graph.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column) [🔗](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column) |
11781179
| 803 | 打砖块 | | [`并查集`](/tag/union-find.md) [`数组`](/tag/array.md) [`矩阵`](/tag/matrix.md) | 🔴 | [🀄️](https://leetcode.cn/problems/bricks-falling-when-hit) [🔗](https://leetcode.com/problems/bricks-falling-when-hit) |
11791180
| 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) |
1181+

‎plan/codetop_list.md

Lines changed: 0 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -208,17 +208,6 @@ headerDepth: 0
208208
| 86 | 分隔链表 | [[]](/problem/0086.md) | [`链表`](/tag/linked-list.md) [`双指针`](/tag/two-pointers.md) | 🟠 | [🀄️](https://leetcode.cn/problems/partition-list) [🔗](https://leetcode.com/problems/partition-list) | 18 |
209209
| 494 | 目标和 | [[]](/problem/0494.md) | [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) [`回溯`](/tag/backtracking.md) | 🟠 | [🀄️](https://leetcode.cn/problems/target-sum) [🔗](https://leetcode.com/problems/target-sum) | 17 |
210210
| 516 | 最长回文子序列 | [[]](/problem/0516.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/longest-palindromic-subsequence) [🔗](https://leetcode.com/problems/longest-palindromic-subsequence) | 17 |
211-
| 115 | 不同的子序列 | [[]](/problem/0115.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🔴 | [🀄️](https://leetcode.cn/problems/distinct-subsequences) [🔗](https://leetcode.com/problems/distinct-subsequences) | 17 |
212-
| 84 | 柱状图中最大的矩形 | [[]](/problem/0084.md) | [``](/tag/stack.md) [`数组`](/tag/array.md) [`单调栈`](/tag/monotonic-stack.md) | 🔴 | [🀄️](https://leetcode.cn/problems/largest-rectangle-in-histogram) [🔗](https://leetcode.com/problems/largest-rectangle-in-histogram) | 17 |
213-
| 97 | 交错字符串 | [[]](/problem/0097.md) | [`字符串`](/tag/string.md) [`动态规划`](/tag/dynamic-programming.md) | 🟠 | [🀄️](https://leetcode.cn/problems/interleaving-string) [🔗](https://leetcode.com/problems/interleaving-string) | 17 |
214-
| 264 | 丑数 II | [[]](/problem/0264.md) | [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/ugly-number-ii) [🔗](https://leetcode.com/problems/ugly-number-ii) | 17 |
215-
| 剑指 Offer 48 | 最长不含重复字符的子字符串 | [[]](/offer/jz_offer_48_1.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof) | 17 |
216-
| 242 | 有效的字母异位词 | [[]](/problem/0242.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/valid-anagram) [🔗](https://leetcode.com/problems/valid-anagram) | 17 |
217-
| 344 | 反转字符串 | [[]](/problem/0344.md) | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-string) [🔗](https://leetcode.com/problems/reverse-string) | 17 |
218-
| 557 | 反转字符串中的单词 III | [[]](/problem/0557.md) | [`双指针`](/tag/two-pointers.md) [`字符串`](/tag/string.md) | 🟢 | [🀄️](https://leetcode.cn/problems/reverse-words-in-a-string-iii) [🔗](https://leetcode.com/problems/reverse-words-in-a-string-iii) | 17 |
219-
| 670 | 最大交换 | [[]](/problem/0670.md) | [`贪心`](/tag/greedy.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/maximum-swap) [🔗](https://leetcode.com/problems/maximum-swap) | 17 |
220-
| 剑指 Offer 11 | 旋转数组的最小数字 | [[]](/offer/jz_offer_11_1.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) | 🟢 | [🀄️](https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof) | 17 |
221-
| 191 | 位1的个数 | [[]](/problem/0191.md) | [`位运算`](/tag/bit-manipulation.md) [`分治`](/tag/divide-and-conquer.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-1-bits) [🔗](https://leetcode.com/problems/number-of-1-bits) | 17 |
222211

223212

224213
::: info

‎plan/contest_list.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1633,7 +1633,7 @@ headerDepth: 0
16331633
| :------: | :------ | :------: | :------ | :------: | :------: |
16341634
| 2549 | 统计桌面上的不同数字 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`数学`](/tag/math.md) `1+` | 🟢 | [🀄️](https://leetcode.cn/problems/count-distinct-numbers-on-board) [🔗](https://leetcode.com/problems/count-distinct-numbers-on-board) |
16351635
| 2550 | 猴子碰撞的方法数 | | [`递归`](/tag/recursion.md) [`数学`](/tag/math.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-collisions-of-monkeys-on-a-polygon) [🔗](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon) |
1636-
| 2551 | 将珠子放入背包中 | | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/put-marbles-in-bags) [🔗](https://leetcode.com/problems/put-marbles-in-bags) |
1636+
| 2551 | 将珠子放入背包中 | [[✓]](/problem/2551.md) | [`贪心`](/tag/greedy.md) [`数组`](/tag/array.md) [`排序`](/tag/sorting.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/put-marbles-in-bags) [🔗](https://leetcode.com/problems/put-marbles-in-bags) |
16371637
| 2552 | 统计上升四元组 | | [`树状数组`](/tag/binary-indexed-tree.md) [`数组`](/tag/array.md) [`动态规划`](/tag/dynamic-programming.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/count-increasing-quadruplets) [🔗](https://leetcode.com/problems/count-increasing-quadruplets) |
16381638

16391639

@@ -2856,7 +2856,7 @@ headerDepth: 0
28562856
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
28572857
| :------: | :------ | :------: | :------ | :------: | :------: |
28582858
| 2032 | 至少在两个数组中出现的值 | [[✓]](/problem/2032.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-out-of-three) [🔗](https://leetcode.com/problems/two-out-of-three) |
2859-
| 2033 | 获取单值网格的最小操作数 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`矩阵`](/tag/matrix.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid) [🔗](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid) |
2859+
| 2033 | 获取单值网格的最小操作数 | [[✓]](/problem/2033.md) | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`矩阵`](/tag/matrix.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/minimum-operations-to-make-a-uni-value-grid) [🔗](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid) |
28602860
| 2034 | 股票价格波动 | | [`设计`](/tag/design.md) [`哈希表`](/tag/hash-table.md) [`数据流`](/tag/data-stream.md) `2+` | 🟠 | [🀄️](https://leetcode.cn/problems/stock-price-fluctuation) [🔗](https://leetcode.com/problems/stock-price-fluctuation) |
28612861
| 2035 | 将数组分成两个数组并最小化数组和的差 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) `4+` | 🔴 | [🀄️](https://leetcode.cn/problems/partition-array-into-two-arrays-to-minimize-sum-difference) [🔗](https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference) |
28622862

0 commit comments

Comments
(0)

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