Leetcode: 322. Coin Change (week13---medium)

题目

 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:

Input: coins = [1, 2, 5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Example 2:

Input: coins = [2], amount = 3
Output: -1

分析

1. 这一道题跟背包问题很类似，只不过是一个给定一个整数，然后寻找最小的整数的组合的数目
2. 相当于背包问题中每一个物件的体积为1，然后价值不同，寻找最小值
3. 然后按着背包问题的思路解决就好了

题解

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