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

    DP:

     1 public class Solution {
     2     public int coinChange(int[] coins, int amount) {
     3         if (coins==null || coins.length==0 || amount<0) return -1;
     4         int[] res = new int[amount+1]; //res[i] is the fewest number of coins to make up amount i
     5         Arrays.fill(res, Integer.MAX_VALUE);
     6         res[0] = 0;
     7         for (int i=1; i<=amount; i++) {
     8             for (int j=0; j<coins.length; j++) {
     9                 if (i-coins[j] < 0) continue;
    10                 if (res[i-coins[j]] == Integer.MAX_VALUE) continue;
    11                 res[i] = Math.min(res[i], res[i-coins[j]]+1);
    12             }
    13         }
    14         return res[amount]==Integer.MAX_VALUE? -1 : res[amount];
    15     }
    16 }
  • 相关阅读:
    数组静态初始化和动态初始化
    一维数组
    标识符啊
    常量定义
    11.08问题总结
    毕设(10.30)
    毕设(10.29)
    毕设(10.28)
    毕设(10.27)
    毕设(10.26)
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/5091565.html
Copyright © 2011-2022 走看看