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

Commit 176a483

Browse filesBrowse files
2xiao2xiao
committed
Deploying to main from @ f53f294 🚀
1 parent db6d82d commit 176a483
Copy full SHA for 176a483

File tree

Expand file treeCollapse file tree

9 files changed

+420
-41
lines changed
Filter options
Expand file treeCollapse file tree

9 files changed

+420
-41
lines changed

‎README.md

Copy file name to clipboardExpand all lines: README.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# LeetCode-JS 通关指南
22

33
<p>
4-
<img src="https://2xiao.github.io/assets/image/leetcode-js-logo.png" alt="logo" height="360"/>
4+
<img src="https://wangfuyou.com/assets/image/leetcode-js-logo.png" alt="logo" height="360"/>
55
</p>
66

77
包含 LeetCode、《剑指 Offer》、《剑指 Offer II》等 1000+ 道算法题的详细题解。
@@ -10,7 +10,7 @@
1010

1111
欢迎「Star ⭐️ 」 和 「Fork」，这是对我最大的鼓励和支持。
1212

13-
电子书：[https://2xiao.github.io/leetcode-js](https://2xiao.github.io/leetcode-js)
13+
电子书：[https://wangfuyou.com/leetcode-js](https://wangfuyou.com/leetcode-js)
1414

1515
源码：[https://github.com/2xiao/leetcode-js](https://github.com/2xiao/leetcode-js)
1616

‎book/hash.md

Copy file name to clipboardExpand all lines: book/hash.md
+2-4Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@
5757

5858
:::: md-demo 相关题目
5959

60-
#### 📌 [705. 设计哈希集合 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0705.html)
60+
#### 📌 [705. 设计哈希集合 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0705.html)
6161

6262
#### 💻 **题目大意**
6363

@@ -169,7 +169,7 @@ class MyHashSet {
169169

170170
:::: md-demo 相关题目
171171

172-
#### 📌 [706. 设计哈希映射 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0706.html)
172+
#### 📌 [706. 设计哈希映射 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0706.html)
173173

174174
#### 💻 **题目大意**
175175

@@ -647,7 +647,6 @@ 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-
651650
## 相关题目
652651

653652
<!-- prettier-ignore -->
@@ -685,4 +684,3 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
685684
| 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) |
686685
| 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) |
687686
| 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

Copy file name to clipboardExpand all lines: book/linked_list.md
+7-9Lines changed: 7 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -520,7 +520,7 @@ console.log(linkedList.count()); // output: 3
520520

521521
:::: md-demo 相关题目
522522

523-
#### 📌 [206. 反转链表 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0206.html)
523+
#### 📌 [206. 反转链表 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0206.html)
524524

525525
#### 💻 **题目大意**
526526

@@ -598,7 +598,7 @@ var reverseList = function (head) {
598598

599599
:::: md-demo 相关题目
600600

601-
#### 📌 [141. 环形链表 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0141.html)
601+
#### 📌 [141. 环形链表 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0141.html)
602602

603603
#### 💻 **题目大意**
604604

@@ -678,7 +678,7 @@ var hasCycle = function (head) {
678678

679679
:::: md-demo 相关题目
680680

681-
#### 📌 [21. 合并两个有序链表 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0021.html)
681+
#### 📌 [21. 合并两个有序链表 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0021.html)
682682

683683
#### 💻 **题目大意**
684684

@@ -755,7 +755,7 @@ var mergeTwoLists = function (list1, list2) {
755755

756756
:::: md-demo 相关题目
757757

758-
#### 📌 [19. 删除链表的倒数第 N 个节点 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0019.html)
758+
#### 📌 [19. 删除链表的倒数第 N 个节点 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0019.html)
759759

760760
#### 💻 **题目大意**
761761

@@ -834,7 +834,7 @@ var removeNthFromEnd = function (head, n) {
834834

835835
:::: md-demo 相关题目
836836

837-
#### 📌 [876. 链表的中间节点 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0876.html)
837+
#### 📌 [876. 链表的中间节点 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0876.html)
838838

839839
#### 💻 **题目大意**
840840

@@ -911,7 +911,7 @@ var middleNode = function (head) {
911911

912912
:::: md-demo 相关题目
913913

914-
#### 📌 [146. LRU 缓存 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0146.html)
914+
#### 📌 [146. LRU 缓存 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0146.html)
915915

916916
#### 💻 **题目大意**
917917

@@ -1068,7 +1068,7 @@ class LRUCache {
10681068

10691069
:::: md-demo 相关题目
10701070

1071-
#### 📌 [148. 链表排序 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0148.html)
1071+
#### 📌 [148. 链表排序 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0148.html)
10721072

10731073
::::
10741074

@@ -1683,7 +1683,6 @@ 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-
16871686
## 相关题目
16881687

16891688
#### 链表基础题目
@@ -1728,4 +1727,3 @@ x.next = p.next; // 将x的节点的next指针指向b节点；
17281727
| 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) |
17291728
| 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) |
17301729
| 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

Copy file name to clipboardExpand all lines: book/queue.md
+1-3Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -248,7 +248,7 @@ console.log(queue.toString()); // output: 2,3
248248

249249
:::: md-demo 相关题目
250250

251-
#### 📌 [622. 设计循环队列 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0622.html)
251+
#### 📌 [622. 设计循环队列 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0622.html)
252252

253253
#### 💻 **题目大意**
254254

@@ -718,7 +718,6 @@ 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-
722721
## 相关题目
723722

724723
#### 队列基础题目
@@ -744,4 +743,3 @@ console.log(priorityQueue.count()); // output: 3
744743
| 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) |
745744
| 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) |
746745
| 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

Copy file name to clipboardExpand all lines: book/stack.md
+5-7Lines changed: 5 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -170,7 +170,7 @@ console.log(stack.count()); // output: 2
170170

171171
:::: md-demo 相关题目
172172

173-
#### 📌 [227. 基本计算器 II - LeetCode](https://2xiao.github.io/leetcode-js/problem/0227.html)
173+
#### 📌 [227. 基本计算器 II - LeetCode](https://wangfuyou.com/leetcode-js/problem/0227.html)
174174

175175
#### 💻 **题目大意**
176176

@@ -223,7 +223,7 @@ console.log(stack.count()); // output: 2
223223

224224
:::: md-demo 相关题目
225225

226-
#### 📌 [20. 有效的括号 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0020.html)
226+
#### 📌 [20. 有效的括号 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0020.html)
227227

228228
#### 💻 **题目大意**
229229

@@ -299,7 +299,7 @@ var isValid = function (s) {
299299

300300
:::: md-demo 相关题目
301301

302-
#### 📌 [1472. 设计浏览器历史记录 - LeetCode](https://2xiao.github.io/leetcode-js/problem/1472.html)
302+
#### 📌 [1472. 设计浏览器历史记录 - LeetCode](https://wangfuyou.com/leetcode-js/problem/1472.html)
303303

304304
#### 💻 **题目大意**
305305

@@ -479,7 +479,7 @@ function add(x, y) {
479479

480480
:::: md-demo 相关题目
481481

482-
#### 📌 [496. 下一个更大元素 I - LeetCode](https://2xiao.github.io/leetcode-js/problem/0496.html)
482+
#### 📌 [496. 下一个更大元素 I - LeetCode](https://wangfuyou.com/leetcode-js/problem/0496.html)
483483

484484
#### 💻 **题目大意**
485485

@@ -549,7 +549,7 @@ var nextGreaterElement = function (nums1, nums2) {
549549

550550
:::: md-demo 相关题目
551551

552-
#### 📌 [739. 每日温度 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0739.html)
552+
#### 📌 [739. 每日温度 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0739.html)
553553

554554
#### 💻 **题目大意**
555555

@@ -619,7 +619,6 @@ 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-
623622
## 相关题目
624623

625624
#### 栈基础题目
@@ -654,4 +653,3 @@ var dailyTemperatures = function (temperatures) {
654653
| 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) |
655654
| 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) |
656655
| 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

Copy file name to clipboardExpand all lines: book/tree.md
+12-14Lines changed: 12 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -120,7 +120,7 @@ postOrder = (r) => {
120120

121121
:::: md-demo 相关题目
122122

123-
#### 📌 [144. 二叉树的前序遍历 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0144.html)
123+
#### 📌 [144. 二叉树的前序遍历 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0144.html)
124124

125125
#### 💻 **题目大意**
126126

@@ -184,7 +184,7 @@ var preorderTraversal = function (root) {
184184

185185
:::: md-demo 相关题目
186186

187-
#### 📌 [145. 二叉树的后序遍历 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0145.html)
187+
#### 📌 [145. 二叉树的后序遍历 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0145.html)
188188

189189
#### 💻 **题目大意**
190190

@@ -243,7 +243,7 @@ var postorderTraversal = function (root) {
243243

244244
:::: md-demo 相关题目
245245

246-
#### 📌 [94. 二叉树的中序遍历 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0094.html)
246+
#### 📌 [94. 二叉树的中序遍历 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0094.html)
247247

248248
#### 💻 **题目大意**
249249

@@ -307,7 +307,7 @@ var inorderTraversal = function (root) {
307307

308308
:::: md-demo 相关题目
309309

310-
#### 📌 [102. 二叉树的层序遍历 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0102.html)
310+
#### 📌 [102. 二叉树的层序遍历 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0102.html)
311311

312312
#### 💻 **题目大意**
313313

@@ -397,7 +397,7 @@ var levelOrder = function (root) {
397397

398398
:::: md-demo 相关题目
399399

400-
#### 📌 [105. 从前序与中序遍历序列构造二叉树 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0105.html)
400+
#### 📌 [105. 从前序与中序遍历序列构造二叉树 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0105.html)
401401

402402
#### 💻 **题目大意**
403403

@@ -432,13 +432,13 @@ var buildTree = function (preorder, inorder) {
432432
};
433433
```
434434

435-
类似的题目还有 [106. 从中序与后序遍历序列构造二叉树 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0106.html) 和 [889. 根据前序和后序遍历构造二叉树 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0889.html)，原理类似，详见题解。
435+
类似的题目还有 [106. 从中序与后序遍历序列构造二叉树 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0106.html) 和 [889. 根据前序和后序遍历构造二叉树 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0889.html)，原理类似，详见题解。
436436

437437
::::
438438

439439
:::: md-demo 相关题目
440440

441-
#### 📌 [654. 最大二叉树 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0654.html)
441+
#### 📌 [654. 最大二叉树 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0654.html)
442442

443443
#### 💻 **题目大意**
444444

@@ -924,7 +924,7 @@ function query(root, queryStart, queryEnd) {
924924

925925
:::: md-demo 相关题目
926926

927-
#### 📌 [307. 区域和检索 - 数组可修改 - LeetCode](https://2xiao.github.io/leetcode-js/problem/0307.html)
927+
#### 📌 [307. 区域和检索 - 数组可修改 - LeetCode](https://wangfuyou.com/leetcode-js/problem/0307.html)
928928

929929
#### 💻 **题目大意**
930930

@@ -1047,7 +1047,6 @@ 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-
10511050
## 相关题目
10521051

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

11081107
#### 线段树
11091108

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

11121111
<!-- prettier-ignore -->
11131112
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1116,7 +1115,7 @@ class NumArray {
11161115
| 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) |
11171116
| 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) |
11181117

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

11211120
<!-- prettier-ignore -->
11221121
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1128,7 +1127,7 @@ class NumArray {
11281127
| 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) |
11291128
| 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) |
11301129

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

11331132
<!-- prettier-ignore -->
11341133
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1137,7 +1136,7 @@ class NumArray {
11371136
| 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) |
11381137
| 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) |
11391138

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

11421141
<!-- prettier-ignore -->
11431142
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
@@ -1178,4 +1177,3 @@ class NumArray {
11781177
| 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) |
11791178
| 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) |
11801179
| 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-

‎problem/0707.md

Copy file name to clipboardExpand all lines: problem/0707.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -88,7 +88,7 @@ Implement the `MyLinkedList` class:
8888

8989
## 解题思路
9090

91-
链表的实现，详细可以参考 [2.2 链表 - 链表的实现](https://2xiao.github.io/leetcode-js/book/linked_list.html#%E9%93%BE%E8%A1%A8%E7%9A%84%E5%AE%9E%E7%8E%B0)
91+
链表的实现，详细可以参考 [2.2 链表 - 链表的实现](https://wangfuyou.com/leetcode-js/book/linked_list.html#%E9%93%BE%E8%A1%A8%E7%9A%84%E5%AE%9E%E7%8E%B0)
9292

9393
## 代码
9494

@@ -210,4 +210,4 @@ MyLinkedList.prototype.deleteAtIndex = function (index) {
210210
<!-- prettier-ignore -->
211211
| 题号 | 标题 | 题解 | 标签 | 难度 | 力扣 |
212212
| :------: | :------ | :------: | :------ | :------: | :------: |
213-
| 1206 | 设计跳表 | | [`设计`](/tag/design.md) [`链表`](/tag/linked-list.md) | 🔴 | [🀄️](https://leetcode.cn/problems/design-skiplist) [🔗](https://leetcode.com/problems/design-skiplist) |
213+
| 1206 | 设计跳表 | | [`设计`](/tag/design.md) [`链表`](/tag/linked-list.md) | 🔴 | [🀄️](https://leetcode.cn/problems/design-skiplist) [🔗](https://leetcode.com/problems/design-skiplist) |

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.