<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>贪心与回溯题解：局部最优与搜索的艺术 on PlumePHP</title><link>https://plumephp.com/posts/algorithm-interview/leetcode/greedy-backtracking/</link><description>Recent content in 贪心与回溯题解：局部最优与搜索的艺术 on PlumePHP</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Mon, 28 Sep 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://plumephp.com/posts/algorithm-interview/leetcode/greedy-backtracking/index.xml" rel="self" type="application/rss+xml"/><item><title>回溯必刷10题：排列组合与搜索模板</title><link>https://plumephp.com/leetcode-backtracking-problems/</link><pubDate>Mon, 28 Sep 2026 10:00:00 +0800</pubDate><guid>https://plumephp.com/leetcode-backtracking-problems/</guid><description>精选 LeetCode 回溯法 10 道必刷题：全排列、子集、组合、组合总和、括号生成、N 皇后、单词搜索、复原 IP 地址、数独、分割回文串，一套通用模板吃透「选与不选」与剪枝去重。</description></item><item><title>贪心必刷9题：从区间问题到序列贪心</title><link>https://plumephp.com/leetcode-greedy-essential-problems/</link><pubDate>Mon, 28 Sep 2026 10:00:00 +0800</pubDate><guid>https://plumephp.com/leetcode-greedy-essential-problems/</guid><description>精选 LeetCode 贪心算法 9 道必刷题：从「排序 + 贪心」的区间问题（无重叠区间、引爆气球），到序列式贪心（跳跃游戏 II、加油站、股票 II），每题给出贪心选择的直觉、正确性证明思路与边界处理。</description></item></channel></rss>