Leetcode 系列题解（十五）

hsu_chan

于 2018-01-13 02:19:43 发布

阅读量193

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/hsu_chan/article/details/79049160

leetcode 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一种使用动态规划解决硬币找零问题的方法。针对给定的不同面额的硬币及总金额，如何计算最少数量的硬币来凑足总金额。如果无法凑足，则返回-1。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

322. Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

Example 1:
coins = [1, 2, 5], amount = 11
return 3 (11 = 5 + 5 + 1)

Example 2:
coins = [2], amount = 3
return -1.

Note:
You may assume that you have an infinite number of each kind of coin.

分析

简单DP。
转移方程如下

d p (i) {m i n {d p (i - c 1), d p (i - c 2), . . ., d p (i - c n)}, 0, for c i in coins i = 0

$dp(i) \begin{cases} min\{dp(i - c_1), dp(i - c_2), ..., dp(i-c_n)\}, & \text{for $c_i$ in coins} \\ 0, & \text{i = 0} \end{cases}$

答案

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        vector<int> dp(amount + 1, INT_MAX - 1);
        dp[0] = 0;
        for (int i = 0; i <= amount; ++i) {
            for (auto c: coins) {
                if (i >= c) dp[i] = min(dp[i], dp[i - c] + 1);
            }
        }
        return dp[amount] == INT_MAX - 1 ? -1 : dp[amount];
    }
};