<?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 Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/zh/tags/%E7%BB%84%E5%90%88/</link><description>Recent content in 组合 on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>zh-cn</language><lastBuildDate>Thu, 02 Apr 2026 13:48:57 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/zh/tags/%E7%BB%84%E5%90%88/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100：组合总和（回溯 / 剪枝 / 可重复选取）ACERS 解析</title><link>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/39-combination-sum/</link><pubDate>Thu, 02 Apr 2026 13:48:57 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/39-combination-sum/</guid><description>围绕 LeetCode 39 讲清组合型回溯、可重复选取、remain 状态与排序剪枝，并用一步一步构建代码的方式把模板真正学会。</description></item><item><title>为什么组合优于继承：灵活性、可测试性与演进成本</title><link>https://jeanphilogong.github.io/jeanblog/zh/dev/design-patterns/composition-over-inheritance/</link><pubDate>Sat, 24 Jan 2026 12:40:32 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/zh/dev/design-patterns/composition-over-inheritance/</guid><description>解释“组合优于继承”的工程原因，并给出可运行示例与落地步骤。</description></item></channel></rss>