Leetcode 518. Coin Change 2 零钱兑换2

322. Coin Change

题目描述

You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.

示例:

Example 1:

Input: amount = 5, coins = [1, 2, 5]
Output: 4
Explanation: there are four ways to make up the amount:
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1

Example 2:

Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.

Example 3:

Input: amount = 10, coins = [10] 
Output: 1

解答

这道题用动态规划做。

组成amount大小的硬币的组合数等于组成amount - c大小的硬币数 (for c in coins) 之和。

也就是dp[i] += dp[i - c];

代码

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