<?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://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/</link><description>Recent content in 完全背包 on Jeanphilo Blog</description><generator>Hugo -- 0.166.0</generator><language>zh-cn</language><lastBuildDate>Tue, 22 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 322：零钱兑换，从更小金额推出完全背包 DP</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/322-coin-change/</link><pubDate>Tue, 22 Sep 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/322-coin-change/</guid><description>从零钱兑换中的贪心失败和更小金额问题出发，逐步构建求最少硬币数量的完全背包动态规划。</description></item></channel></rss>