zoukankan      html  css  js  c++  java
  • [LeetCode] Coin Change

    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:
    coins = [1, 2, 5], amount = 11
    return 3 (11 = 5 + 5 + 1)

    Example 2:
    coins = [2], amount = 3
    return -1.

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

    Credits:
    Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

    DP!

     1 class Solution {
     2 public:
     3     int coinChange(vector<int>& coins, int amount) {
     4         vector<int> dp(amount + 1, INT_MAX);
     5         dp[0] = 0;
     6         for (auto coin : coins) {
     7             for (int i = coin; i <= amount; ++i) {
     8                 if (dp[i-coin] != INT_MAX) {
     9                     dp[i] = min(dp[i], dp[i - coin] + 1);
    10                 }
    11             }
    12         }
    13         return dp[amount] == INT_MAX ? -1 : dp[amount];
    14     }
    15 };
  • 相关阅读:
    Jam的计数法
    你已经爱我多久了
    脏话过滤
    三角恋
    栈练习3
    栈练习2
    栈练习
    高精度之乘法
    高精度之减法
    高精度之加法
  • 原文地址:https://www.cnblogs.com/easonliu/p/5082283.html
Copyright © 2011-2022 走看看