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];
        }
    }
  • 相关阅读:
    d
    今天刚注册,测试下
    关于Hadoop的简单介绍
    leveldb 阅读笔记 (2) 简易测试框架
    leveldb 阅读笔记(1) 内存分配器 Arena
    数论
    伴随网站
    convenience website
    大佬独特的骗分技巧
    动态规划
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12215880.html
Copyright © 2011-2022 走看看