<?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 Answer</title>
    <link>https://answer.freetools.me/tags/%E5%B9%B6%E6%9F%A5%E9%9B%86/</link>
    <description>Recent content in 并查集 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 21:46:45 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%B9%B6%E6%9F%A5%E9%9B%86/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>最小生成树为何能用两种截然不同的方式构建从Prim到Kruskal的完整LeetCode通关指南</title>
      <link>https://answer.freetools.me/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%A4%E7%A7%8D%E6%88%AA%E7%84%B6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%96%B9%E5%BC%8F%E6%9E%84%E5%BB%BA%E4%BB%8Eprim%E5%88%B0kruskal%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 21:46:45 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%A4%E7%A7%8D%E6%88%AA%E7%84%B6%E4%B8%8D%E5%90%8C%E7%9A%84%E6%96%B9%E5%BC%8F%E6%9E%84%E5%BB%BA%E4%BB%8Eprim%E5%88%B0kruskal%E7%9A%84%E5%AE%8C%E6%95%B4leetcode%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解最小生成树算法的深度教程，从切分定理到Prim与Kruskal两种经典实现，结合LeetCode题目（1135/1584/1489/1579）的完整Java解答与算法选择策略，帮助彻底掌握这一图论核心问题。</description>
    </item>
    <item>
      <title>并查集：从社交网络连通性到LeetCode通关的完整指南</title>
      <link>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:39:07 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%B9%B6%E6%9F%A5%E9%9B%86%E4%BB%8E%E7%A4%BE%E4%BA%A4%E7%BD%91%E7%BB%9C%E8%BF%9E%E9%80%9A%E6%80%A7%E5%88%B0leetcode%E9%80%9A%E5%85%B3%E7%9A%84%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解并查集数据结构的深度教程，从核心原理到路径压缩与按秩合并的优化技巧，结合LeetCode经典题目（547/684/721/990/765/947/1202/1319/952/1697等）的完整Java实现与复杂度分析，帮助彻底掌握这一面试高频数据结构。</description>
    </item>
  </channel>
</rss>
