https://wishbottle.cn/tags/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95/Recent content in 贪心算法 on WishBottleHugozh-cnMon, 02 Nov 2026 15:15:00 +0800https://wishbottle.cn/posts/cumt-algorithms-greedy/Mon, 02 Nov 2026 15:15:01 +0800https://wishbottle.cn/posts/cumt-algorithms-greedy/<h2 class="heading" id="1-贪心策略与适用条件"> 1 贪心策略与适用条件 <a class="anchor" href="#1-%e8%b4%aa%e5%bf%83%e7%ad%96%e7%95%a5%e4%b8%8e%e9%80%82%e7%94%a8%e6%9d%a1%e4%bb%b6">#</a> </h2> <p>贪心法每一步按某个规则选择当前最有利的方案。必须说明规则为什么能产生整体最优解；算对一个例子不足以证明正确，一个反例就能否定某种策略的普遍正确性。</p>