<?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>LeetCode 19 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-19/</link><description>Recent content in LeetCode 19 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Wed, 11 Feb 2026 07:56:02 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-19/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 19：删除链表的倒数第 N 个结点（双指针一趟扫描）ACERS 全解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/19-remove-nth-node-from-end-of-list/</link><pubDate>Wed, 11 Feb 2026 07:56:02 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/19-remove-nth-node-from-end-of-list/</guid><description>从朴素两趟遍历到一趟快慢指针，系统讲清删除链表倒数第 N 个结点的思路、正确性、工程场景与多语言可运行实现。</description></item></channel></rss>