<?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 547 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-547/</link><description>Recent content in LeetCode 547 on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>zh-cn</language><lastBuildDate>Wed, 27 May 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-547/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 547：省份数量，把邻接矩阵看成图的连通分量</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/547-number-of-provinces/</link><pubDate>Wed, 27 May 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/547-number-of-provinces/</guid><description>从邻接矩阵的直接连接关系出发，把 LeetCode 547 省份数量转成无向图连通分量计数问题，再逐步推出 DFS、BFS 和并查集解法。</description></item></channel></rss>