@@ -520,7 +520,7 @@ console.log(linkedList.count()); // output: 3
520
520
521
521
:::: md-demo 相关题目
522
522
523
- #### 📌 [ 206. 反转链表 - LeetCode] ( https://2xiao.github.io /leetcode-js/problem/0206.html )
523
+ #### 📌 [ 206. 反转链表 - LeetCode] ( https://wangfuyou.com /leetcode-js/problem/0206.html )
524
524
525
525
#### 💻 ** 题目大意**
526
526
@@ -598,7 +598,7 @@ var reverseList = function (head) {
598
598
599
599
:::: md-demo 相关题目
600
600
601
- #### 📌 [ 141. 环形链表 - LeetCode] ( https://2xiao.github.io /leetcode-js/problem/0141.html )
601
+ #### 📌 [ 141. 环形链表 - LeetCode] ( https://wangfuyou.com /leetcode-js/problem/0141.html )
602
602
603
603
#### 💻 ** 题目大意**
604
604
@@ -678,7 +678,7 @@ var hasCycle = function (head) {
678
678
679
679
:::: md-demo 相关题目
680
680
681
- #### 📌 [ 21. 合并两个有序链表 - LeetCode] ( https://2xiao.github.io /leetcode-js/problem/0021.html )
681
+ #### 📌 [ 21. 合并两个有序链表 - LeetCode] ( https://wangfuyou.com /leetcode-js/problem/0021.html )
682
682
683
683
#### 💻 ** 题目大意**
684
684
@@ -755,7 +755,7 @@ var mergeTwoLists = function (list1, list2) {
755
755
756
756
:::: md-demo 相关题目
757
757
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 )
759
759
760
760
#### 💻 ** 题目大意**
761
761
@@ -834,7 +834,7 @@ var removeNthFromEnd = function (head, n) {
834
834
835
835
:::: md-demo 相关题目
836
836
837
- #### 📌 [ 876. 链表的中间节点 - LeetCode] ( https://2xiao.github.io /leetcode-js/problem/0876.html )
837
+ #### 📌 [ 876. 链表的中间节点 - LeetCode] ( https://wangfuyou.com /leetcode-js/problem/0876.html )
838
838
839
839
#### 💻 ** 题目大意**
840
840
@@ -911,7 +911,7 @@ var middleNode = function (head) {
911
911
912
912
:::: md-demo 相关题目
913
913
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 )
915
915
916
916
#### 💻 ** 题目大意**
917
917
@@ -1068,7 +1068,7 @@ class LRUCache {
1068
1068
1069
1069
:::: md-demo 相关题目
1070
1070
1071
- #### 📌 [ 148. 链表排序 - LeetCode] ( https://2xiao.github.io /leetcode-js/problem/0148.html )
1071
+ #### 📌 [ 148. 链表排序 - LeetCode] ( https://wangfuyou.com /leetcode-js/problem/0148.html )
1072
1072
1073
1073
::::
1074
1074
@@ -1683,7 +1683,6 @@ x.next = p.next; // 将x的节点的next指针指向b节点;
1683
1683
<!-- Please keep comment here to allow auto update -->
1684
1684
<!-- DON'T EDIT THIS SECTION, INSTEAD RE-RUN `npm run lc` TO UPDATE -->
1685
1685
1686
-
1687
1686
## 相关题目
1688
1687
1689
1688
#### 链表基础题目
@@ -1728,4 +1727,3 @@ x.next = p.next; // 将x的节点的next指针指向b节点;
1728
1727
| 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 ) |
1729
1728
| 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 ) |
1730
1729
| 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
-
0 commit comments