<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Linked List on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/linked-list/</link><description>Recent content in Linked List on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/linked-list/index.xml" rel="self" type="application/rss+xml"/><item><title>2058. 寻找临界点之间的最小和最大距离</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/</link><pubDate>Thu, 30 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/</guid><description>Medium | Linked List</description></item><item><title>3217. 从链表中删除存在于数组中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3217-delete-nodes-from-linked-list-present-in-array/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3217-delete-nodes-from-linked-list-present-in-array/</guid><description>Medium | Array, Hash Table, Linked List</description></item><item><title>3507. 最小配对移除操作使数组有序 I</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3507-minimum-pair-removal-to-sort-array-i/</guid><description>Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</description></item><item><title>3510. 最小配对移除使数组有序 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3510-minimum-pair-removal-to-sort-array-ii/</guid><description>Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set</description></item><item><title>2807. 在链表中插入最大公约数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2807-insert-greatest-common-divisors-in-linked-list/</guid><description>Medium | Linked List, Math, Number Theory</description></item><item><title>2816. 将链表表示的数字翻倍</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</link><pubDate>Sat, 25 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2816-double-a-number-represented-as-a-linked-list/</guid><description>Medium | Linked List, Math, Stack</description></item><item><title>2074. 反转偶数长度组的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2074-reverse-nodes-in-even-length-groups/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2074-reverse-nodes-in-even-length-groups/</guid><description>Medium | Linked List</description></item><item><title>2095. 删除链表的中间节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2095-delete-the-middle-node-of-a-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2095-delete-the-middle-node-of-a-linked-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>2130. 链表的最大孪生和</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2130-maximum-twin-sum-of-a-linked-list/</guid><description>Medium | Linked List, Two Pointers, Stack</description></item><item><title>2181. 合并零之间的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2181-merge-nodes-in-between-zeros/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2181-merge-nodes-in-between-zeros/</guid><description>Medium | Linked List, Simulation</description></item><item><title>2289. 使数组非递减的步数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2289-steps-to-make-array-non-decreasing/</guid><description>Medium | Array, Linked List, Dynamic Programming, Stack, Monotonic Stack, Simulation</description></item><item><title>2296. 设计文本编辑器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2296-design-a-text-editor/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2296-design-a-text-editor/</guid><description>Hard | Linked List, String, Stack, Design, Simulation, Doubly-Linked List</description></item><item><title>2326. 螺旋矩阵 IV</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2326-spiral-matrix-iv/</guid><description>Medium | Array, Linked List, Matrix, Simulation</description></item><item><title>2487. 从链表中移除节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</link><pubDate>Fri, 24 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/2487-remove-nodes-from-linked-list/</guid><description>Medium | Linked List, Stack, Recursion, Monotonic Stack</description></item><item><title>1290. 将二进制链表转换为整数</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1290-convert-binary-number-in-a-linked-list-to-integer/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1290-convert-binary-number-in-a-linked-list-to-integer/</guid><description>Easy | Linked List, Math</description></item><item><title>1367. 二叉树中的链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1367-linked-list-in-binary-tree/</guid><description>Medium | Linked List, Tree, Depth-First Search, Binary Tree</description></item><item><title>1472. 设计浏览器历史记录</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1472-design-browser-history/</guid><description>Medium | Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream</description></item><item><title>1669. 区间链表合并</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1669-merge-in-between-linked-lists/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1669-merge-in-between-linked-lists/</guid><description>Medium | Linked List</description></item><item><title>1670. 设计前中后队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1670-design-front-middle-back-queue/</guid><description>Medium | Array, Linked List, Design, Queue, Doubly-Linked List, Data Stream</description></item><item><title>1721. 交换链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1721-swapping-nodes-in-a-linked-list/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1721-swapping-nodes-in-a-linked-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>1797. 设计身份验证管理器</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1797-design-authentication-manager/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1797-design-authentication-manager/</guid><description>Medium | Hash Table, Linked List, Design, Doubly-Linked List</description></item><item><title>1019. 链表中的下一个更大节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1019-next-greater-node-in-linked-list/</guid><description>Medium | Array, Linked List, Stack, Monotonic Stack</description></item><item><title>1171. 从链表中删去总和值为零的连续节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1171-remove-zero-sum-consecutive-nodes-from-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1171-remove-zero-sum-consecutive-nodes-from-linked-list/</guid><description>Medium | Hash Table, Linked List</description></item><item><title>1206. 设计跳表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1206-design-skiplist/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1206-design-skiplist/</guid><description>Hard | Linked List, Design</description></item><item><title>725. 分割链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0725-split-linked-list-in-parts/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0725-split-linked-list-in-parts/</guid><description>Medium | Linked List</description></item><item><title>817. 链表组件</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0817-linked-list-components/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0817-linked-list-components/</guid><description>Medium | Array, Hash Table, Linked List</description></item><item><title>876. 链表的中间结点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0876-middle-of-the-linked-list/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0876-middle-of-the-linked-list/</guid><description>Easy | Linked List, Two Pointers</description></item><item><title>622. 设计循环队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0622-design-circular-queue/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>641. 设计循环双端队列</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0641-design-circular-deque/</guid><description>Medium | Array, Linked List, Design, Queue</description></item><item><title>705. 设计哈希集合</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0705-design-hashset/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0705-design-hashset/</guid><description>Easy | Array, Hash Table, Linked List, Design, Hash Function</description></item><item><title>706. 设计哈希映射</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0706-design-hashmap/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0706-design-hashmap/</guid><description>Easy | Array, Hash Table, Linked List, Design, Hash Function</description></item><item><title>707. 设计链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0707-design-linked-list/</link><pubDate>Tue, 21 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0707-design-linked-list/</guid><description>Medium | Linked List, Design</description></item><item><title>328. 奇偶链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0328-odd-even-linked-list/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0328-odd-even-linked-list/</guid><description>Medium | Linked List</description></item><item><title>355. 设计推特</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0355-design-twitter/</guid><description>Medium | Hash Table, Linked List, Design, Heap (Priority Queue)</description></item><item><title>382. 链表随机节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0382-linked-list-random-node/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0382-linked-list-random-node/</guid><description>Medium | Linked List, Math, Reservoir Sampling, Randomized</description></item><item><title>430. 扁平化多级双向链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0430-flatten-a-multilevel-doubly-linked-list/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0430-flatten-a-multilevel-doubly-linked-list/</guid><description>Medium | Linked List, Depth-First Search, Doubly-Linked List</description></item><item><title>432. 全 O(1) 的数据结构</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0432-all-oone-data-structure/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0432-all-oone-data-structure/</guid><description>Hard | Hash Table, Linked List, Design, Doubly-Linked List</description></item><item><title>445. 两数相加 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0445-add-two-numbers-ii/</guid><description>Medium | Linked List, Math, Stack</description></item><item><title>460. LFU 缓存</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0460-lfu-cache/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0460-lfu-cache/</guid><description>Hard | Hash Table, Linked List, Design, Doubly-Linked List</description></item><item><title>109. 将有序链表转换为二叉搜索树</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0109-convert-sorted-list-to-binary-search-tree/</guid><description>Medium | Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree</description></item><item><title>114. 二叉树展开为链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0114-flatten-binary-tree-to-linked-list/</guid><description>Medium | Linked List, Stack, Tree, Depth-First Search, Binary Tree</description></item><item><title>116. 填充每个节点的下一个右侧节点指针</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0116-populating-next-right-pointers-in-each-node/</guid><description>Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>117. 填充每个节点的下一个右侧节点指针 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0117-populating-next-right-pointers-in-each-node-ii/</guid><description>Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree</description></item><item><title>138. 复制带随机指针的链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0138-copy-list-with-random-pointer/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0138-copy-list-with-random-pointer/</guid><description>Medium | Hash Table, Linked List</description></item><item><title>141. 环形链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0141-linked-list-cycle/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0141-linked-list-cycle/</guid><description>Easy | Hash Table, Linked List, Two Pointers</description></item><item><title>142. 环形链表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0142-linked-list-cycle-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0142-linked-list-cycle-ii/</guid><description>Medium | Hash Table, Linked List, Two Pointers</description></item><item><title>143. 重排链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0143-reorder-list/</guid><description>Medium | Linked List, Two Pointers, Stack, Recursion</description></item><item><title>146. LRU 缓存</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0146-lru-cache/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0146-lru-cache/</guid><description>Medium | Hash Table, Linked List, Design, Doubly-Linked List</description></item><item><title>147. 插入排序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0147-insertion-sort-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0147-insertion-sort-list/</guid><description>Medium | Linked List, Sorting</description></item><item><title>148. 排序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0148-sort-list/</guid><description>Medium | Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort</description></item><item><title>160. 相交链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0160-intersection-of-two-linked-lists/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0160-intersection-of-two-linked-lists/</guid><description>Easy | Hash Table, Linked List, Two Pointers</description></item><item><title>19. 删除链表的倒数第 N 个结点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0019-remove-nth-node-from-end-of-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0019-remove-nth-node-from-end-of-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>2. 两数相加</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0002-add-two-numbers/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0002-add-two-numbers/</guid><description>Medium | Linked List, Math, Recursion</description></item><item><title>203. 移除链表元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0203-remove-linked-list-elements/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0203-remove-linked-list-elements/</guid><description>Easy | Linked List, Recursion</description></item><item><title>206. 反转链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0206-reverse-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0206-reverse-linked-list/</guid><description>Easy | Linked List, Recursion</description></item><item><title>21. 合并两个有序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0021-merge-two-sorted-lists/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0021-merge-two-sorted-lists/</guid><description>Easy | Linked List, Recursion</description></item><item><title>23. 合并K个升序链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0023-merge-k-sorted-lists/</guid><description>Hard | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort</description></item><item><title>234. 回文链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0234-palindrome-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0234-palindrome-linked-list/</guid><description>Easy | Linked List, Two Pointers, Stack, Recursion</description></item><item><title>237. 删除链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0237-delete-node-in-a-linked-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0237-delete-node-in-a-linked-list/</guid><description>Medium | Linked List</description></item><item><title>24. 两两交换链表中的节点</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0024-swap-nodes-in-pairs/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0024-swap-nodes-in-pairs/</guid><description>Medium | Linked List, Recursion</description></item><item><title>25. K 个一组翻转链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0025-reverse-nodes-in-k-group/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0025-reverse-nodes-in-k-group/</guid><description>Hard | Linked List, Recursion</description></item><item><title>61. 旋转链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0061-rotate-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0061-rotate-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>82. 删除排序链表中的重复元素 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0082-remove-duplicates-from-sorted-list-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0082-remove-duplicates-from-sorted-list-ii/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>83. 删除排序链表中的重复元素</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0083-remove-duplicates-from-sorted-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0083-remove-duplicates-from-sorted-list/</guid><description>Easy | Linked List</description></item><item><title>86. 分隔链表</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0086-partition-list/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0086-partition-list/</guid><description>Medium | Linked List, Two Pointers</description></item><item><title>92. 反转链表 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0092-reverse-linked-list-ii/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0092-reverse-linked-list-ii/</guid><description>Medium | Linked List</description></item></channel></rss>