<?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/%E8%B4%AA%E5%BF%83%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 23:55:27 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>股票买卖问题为何能用一套代码解决所有变体从状态机DP到贪心的统一框架</title>
      <link>https://answer.freetools.me/%E8%82%A1%E7%A5%A8%E4%B9%B0%E5%8D%96%E9%97%AE%E9%A2%98%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%80%E5%A5%97%E4%BB%A3%E7%A0%81%E8%A7%A3%E5%86%B3%E6%89%80%E6%9C%89%E5%8F%98%E4%BD%93%E4%BB%8E%E7%8A%B6%E6%80%81%E6%9C%BAdp%E5%88%B0%E8%B4%AA%E5%BF%83%E7%9A%84%E7%BB%9F%E4%B8%80%E6%A1%86%E6%9E%B6/</link>
      <pubDate>Sun, 08 Mar 2026 23:55:27 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%82%A1%E7%A5%A8%E4%B9%B0%E5%8D%96%E9%97%AE%E9%A2%98%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8%E4%B8%80%E5%A5%97%E4%BB%A3%E7%A0%81%E8%A7%A3%E5%86%B3%E6%89%80%E6%9C%89%E5%8F%98%E4%BD%93%E4%BB%8E%E7%8A%B6%E6%80%81%E6%9C%BAdp%E5%88%B0%E8%B4%AA%E5%BF%83%E7%9A%84%E7%BB%9F%E4%B8%80%E6%A1%86%E6%9E%B6/</guid>
      <description>深度解析LeetCode股票买卖问题系列（121/122/123/188/309/714）的统一解法框架，从状态机DP的核心原理到贪心算法的正确性证明，包含所有六道题目的Java完整解答与面试技巧。</description>
    </item>
    <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>
