<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>链表题解：反转、合并、环检测与 LRU on PlumePHP</title><link>https://plumephp.com/posts/algorithm-interview/leetcode/linked-list/</link><description>Recent content in 链表题解：反转、合并、环检测与 LRU on PlumePHP</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Fri, 25 Sep 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://plumephp.com/posts/algorithm-interview/leetcode/linked-list/index.xml" rel="self" type="application/rss+xml"/><item><title>链表必刷8题：反转、合并、环检测与LRU实现</title><link>https://plumephp.com/leetcode-linked-list-essential-problems/</link><pubDate>Fri, 25 Sep 2026 00:00:00 +0800</pubDate><guid>https://plumephp.com/leetcode-linked-list-essential-problems/</guid><description>精选LeetCode链表领域8道必刷题目：反转链表、合并有序链表、环形链表检测、相交链表、奇偶重排、删除倒数第N个节点、排序链表与LRU缓存，详解迭代与递归两种写法。</description></item></channel></rss>