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.

Test Cases

Copy an input into the main harness and Run to verify

Input

coins = [1,2,5], amount = 11

Expected Output

3

Explanation: 11 = 5 + 5 + 1

Input

coins = [2], amount = 3

Expected Output

-1

Input

coins = [1], amount = 0

Expected Output

0

Constraints

1 <= coins.length <= 12
1 <= coins[i] <= 2^31 - 1
0 <= amount <= 10^4

Hints

Hint 1 — click to reveal

Think bottom-up: dp[a] = minimum coins to form amount a.

Hint 2 — click to reveal

dp[a] = min over coins c of dp[a - c] + 1.

Java Compiler