<?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>LeetCode 40 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-40/</link><description>Recent content in LeetCode 40 on Jeanphilo Blog</description><generator>Hugo -- 0.161.1</generator><language>zh-cn</language><lastBuildDate>Fri, 17 Apr 2026 14:31:11 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-40/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 40：组合总和 II（回溯 / 同层去重 / 只能用一次）ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/40-combination-sum-ii/</link><pubDate>Fri, 17 Apr 2026 14:31:11 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/40-combination-sum-ii/</guid><description>围绕 LeetCode 40 讲清“每个位置只能用一次”与“同层去重”的真正含义，并用一步一步推导的方式建立稳定回溯模板。</description></item></channel></rss>