<?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>随机指针 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88/</link><description>Recent content in 随机指针 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Wed, 11 Feb 2026 07:59:32 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E9%9A%8F%E6%9C%BA%E6%8C%87%E9%92%88/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 138：随机链表的复制（Copy List with Random Pointer）深拷贝全解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/</link><pubDate>Wed, 11 Feb 2026 07:59:32 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/</guid><description>随机链表复制的核心是把“原节点身份”映射到“新节点身份”，再重建 next/random 指针。本文用 ACERS 结构给出思路推导、工程类比、常见坑和多语言可运行实现。</description></item></channel></rss>