<?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/alg/leetcode/hot100/union-find/</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/alg/leetcode/hot100/union-find/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 200：岛屿数量，把网格陆地看成连通分量</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/union-find/200-number-of-islands/</link><pubDate>Thu, 02 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/union-find/200-number-of-islands/</guid><description>从网格中相邻陆地的合并压力出发，用并查集推导 LeetCode 200 岛屿数量，讲清二维坐标映射、陆地初始 count、union 后 count 什么时候减少。</description></item><item><title>并查集模板：find / union / count 从零推导</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/union-find/union-find-template/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/union-find/union-find-template/</guid><description>从一个集合合并小任务出发，推导并查集模板中的 parent、find、union、count 和路径压缩，最终得到可直接背写的 Python 模板。</description></item></channel></rss>