Minimum Coins for an Amount
Problem statement
You are given positive integer coin denominations coins and a target amount. Each denomination may be used any number of times.
Return the minimum number of coins whose values sum exactly to amount. Return -1 if it cannot be formed. The minimum for amount zero is zero.
Function
minimumCoins(coins: int[], amount: int) → intExamples
Example 1
coins = [1,3,4]amount = 6return = 2Two coins of value 3 form 6. No single available coin forms 6.
Example 2
coins = [2]amount = 3return = -1Every sum of coins of value 2 is even, so 3 is unreachable.
Constraints
1 <= coins.length <= 20.1 <= coins[i] <= 2000.0 <= amount <= 2000.