zoukankan      html  css  js  c++  java
  • [LC] 322. 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:

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

    Example 2:

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

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

    class Solution {
        public int coinChange(int[] coins, int amount) {
            if (coins == null || coins.length == 0) {
               return -1;
            }
            int[] arr = new int[amount + 1];
            for (int i = 1; i <= amount; i++) {
                arr[i] = Integer.MAX_VALUE;
                for (int j = 0; j < coins.length; j++) {
                    if (i >= coins[j] && arr[i - coins[j]] != -1) {
                        // like knapbag exclude the previous amoutn of i - arr[j]
                        arr[i] = Math.min(arr[i], arr[i - coins[j]] + 1);
                    }
                }
                arr[i] = arr[i] == Integer.MAX_VALUE ? -1 : arr[i];
            }
            return arr[amount];
        }
    }
  • 相关阅读:
    linux 邮件服务器
    Nginx学习之keepalive
    explain 和 desc 详解
    mysql 常用语句
    loop设备及losetup命令
    cryptsetup文件系统加密
    ftp主动与被动模式详解
    大型网站关键技术
    大访问量网站架构设计
    Mysql 的事务隔离级别
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12215880.html
Copyright © 2011-2022 走看看