LeetCode 0322 - Coin Change

Coin Change

Desicription

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:

代码语言：javascript复制

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

Example 2:

代码语言：javascript复制

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

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

Solution

代码语言：javascript复制

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

        return dp[amount] > amount ? -1 : dp[amount];
    }
};

function return

0 人点赞