@@ -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-
0 commit comments