<?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/%E6%A0%91/</link><description>Recent content in 树 on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>zh-cn</language><lastBuildDate>Thu, 02 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%A0%91/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 684：冗余连接，用 union 失败找到成环边</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/union-find/684-redundant-connection/</link><pubDate>Thu, 02 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/union-find/684-redundant-connection/</guid><description>从树加一条边必然成环的压力出发，用并查集推导 LeetCode 684 冗余连接，讲清 1-indexed parent、union 返回值和为什么 union 失败就是答案。</description></item></channel></rss>