力扣第322题 零钱兑换

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