Leetcode 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

method dp

the optimal solution can be constructed from optimal solutions of its subproblems

int coinChange(vector<int>& coins, int amount) {
        if(amount == 0) return 0;
        sort(coins.begin(), coins.end());
        vector<int> dp(amount + 1);
        int start = coins[0];
        if (start > amount)
            return -1;
        dp[start] = 1;

    for (int i = start+1; i < amount + 1; i++) {
        dp[i] = INT_MAX;
    }

    for (int i = start + 1; i <= amount; i++) {
        for (int k = 0; k < coins.size(); k++) {
            if (i == coins[k])
                dp[i] = 1;
            else if (i - coins[k] >= start && dp[i-coins[k]] != INT_MAX)
                dp[i] = min(dp[i], 1 + dp[i - coins[k]]);
        }
    }

    return dp[amount] == INT_MAX ? -1 : dp[amount];
    }

summary

1. 这里的dp是以给的amount为范围，而不是以给的数组为范围
2. 每一步的dp都与之前的多个状态相关。
3. 只求计数，而不求具体结果的dp