<?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>Greedy Algorithm on Answer</title>
    <link>https://answer.freetools.me/tags/greedy-algorithm/</link>
    <description>Recent content in Greedy Algorithm on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 20:20:02 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/greedy-algorithm/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>贪心算法:为什么每次只做局部最优选择却能得到全局最优解</title>
      <link>https://answer.freetools.me/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BB%80%E4%B9%88%E6%AF%8F%E6%AC%A1%E5%8F%AA%E5%81%9A%E5%B1%80%E9%83%A8%E6%9C%80%E4%BC%98%E9%80%89%E6%8B%A9%E5%8D%B4%E8%83%BD%E5%BE%97%E5%88%B0%E5%85%A8%E5%B1%80%E6%9C%80%E4%BC%98%E8%A7%A3/</link>
      <pubDate>Sun, 08 Mar 2026 20:20:02 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BB%80%E4%B9%88%E6%AF%8F%E6%AC%A1%E5%8F%AA%E5%81%9A%E5%B1%80%E9%83%A8%E6%9C%80%E4%BC%98%E9%80%89%E6%8B%A9%E5%8D%B4%E8%83%BD%E5%BE%97%E5%88%B0%E5%85%A8%E5%B1%80%E6%9C%80%E4%BC%98%E8%A7%A3/</guid>
      <description>一篇系统讲解贪心算法的完整指南，从拟阵理论到交换论证的证明方法，结合LeetCode六大类型题目（区间调度、跳跃覆盖、资源分配、重排构造、序列分割、调度优化）的Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
  </channel>
</rss>
