zoukankan      html  css  js  c++  java
  • 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.

    Analyse: Dynamic Programming. 

    Runtime: 156ms.

    For money from 1~amount, compute its smallest coin number and update the number. 

    dp[i] = min(dp[i], dp[i - coins[j]] + 1) where j is from [0, coins.size()). 

     1 class Solution {
     2 public:
     3     int coinChange(vector<int>& coins, int amount) {
     4         vector<int> dp(amount + 1, amount + 1);
     5         
     6         dp[0] = 0;
     7         for(int i = 1; i <= amount; i++) {
     8             for(int j = 0; j < coins.size(); j++) {
     9                 if(i >= coins[j])
    10                     dp[i] = min(dp[i], dp[i - coins[j]] + 1);
    11             }
    12         }
    13         return dp[amount] > amount ? -1 : dp[amount];
    14     }
    15 };
  • 相关阅读:
    力扣题解 125th 验证回文字符串
    力扣题解 242th 有效的字母异位词
    力扣题解 387th 字符串中的第一个唯一字符
    Ubuntu
    Ubuntu
    Ubuntu
    ubuntu
    go-vscode-ubuntu20.04安装部署
    go-vscode-windows安装部署
    2020年任务
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5739796.html
Copyright © 2011-2022 走看看