https://h30306.github.io/blog/zh-tw/tags/knapsack-dp/Recent content in Knapsack-Dp onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 13 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/zh-tw/leetcode/leetcode-4081/Tue, 13 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-4081/LeetCode 4081 解題筆記：篩出質數後做 0/1 背包，dp[j] 是湊出 j 的最少個數；質數由大到小放，個數一樣時新的組合開頭比較小，所以用 <= 更新就是字典序最小