Package g0301_0400.s0322_coin_change

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    322 - Coin Change\.

    Medium

    You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

    Return 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.

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

    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

    Example 3:

    Input: coins = 1, amount = 0

    Output: 0

    Constraints:

    • 1 <= coins.length <= 12

    • <code>1 <= coinsi<= 2<sup>31</sup> - 1</code>

    • <code>0 <= amount <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer coinChange(IntArray coins, Integer amount)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait