<?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>Divide and Conquer on Answer</title>
    <link>https://answer.freetools.me/tags/divide-and-conquer/</link>
    <description>Recent content in Divide and Conquer on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 20:55:37 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/divide-and-conquer/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>为什么把问题拆开反而更快？分治算法从主定理到LeetCode完整指南</title>
      <link>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%8A%8A%E9%97%AE%E9%A2%98%E6%8B%86%E5%BC%80%E5%8F%8D%E8%80%8C%E6%9B%B4%E5%BF%AB%E5%88%86%E6%B2%BB%E7%AE%97%E6%B3%95%E4%BB%8E%E4%B8%BB%E5%AE%9A%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</link>
      <pubDate>Sun, 08 Mar 2026 20:55:37 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%BA%E4%BB%80%E4%B9%88%E6%8A%8A%E9%97%AE%E9%A2%98%E6%8B%86%E5%BC%80%E5%8F%8D%E8%80%8C%E6%9B%B4%E5%BF%AB%E5%88%86%E6%B2%BB%E7%AE%97%E6%B3%95%E4%BB%8E%E4%B8%BB%E5%AE%9A%E7%90%86%E5%88%B0leetcode%E5%AE%8C%E6%95%B4%E6%8C%87%E5%8D%97/</guid>
      <description>一篇系统讲解分治算法的完整指南，从主定理的数学原理到LeetCode六大类型题目（排序选择、区间问题、表达式构造、几何最近邻、快速幂、树链表转换）的Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
  </channel>
</rss>
