<?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%88%86%E5%8C%BA%E7%AE%97%E6%B3%95/</link>
    <description>Recent content in 分区算法 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 21:23:39 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%88%86%E5%8C%BA%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>快速选择算法：为何能在O(n)时间内找到第K大元素？从原理到LeetCode完整通关指南</title>
      <link>https://answer.freetools.me/%E5%BF%AB%E9%80%9F%E9%80%89%E6%8B%A9%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E5%9C%A8on%E6%97%B6%E9%97%B4%E5%86%85%E6%89%BE%E5%88%B0%E7%AC%ACk%E5%A4%A7%E5%85%83%E7%B4%A0%E4%BB%8E%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 21:23:39 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%BF%AB%E9%80%9F%E9%80%89%E6%8B%A9%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E5%9C%A8on%E6%97%B6%E9%97%B4%E5%86%85%E6%89%BE%E5%88%B0%E7%AC%ACk%E5%A4%A7%E5%85%83%E7%B4%A0%E4%BB%8E%E5%8E%9F%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E9%80%9A%E5%85%B3%E6%8C%87%E5%8D%97/</guid>
      <description>深入解析快速选择算法的原理、时间复杂度证明、与堆方法的对比，以及LeetCode相关问题的完整解答，包括215、347、973、703等经典题目。</description>
    </item>
  </channel>
</rss>
