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
分析:可以用动态规划解决,
def coinChange(self, coins, amount):
"""
:type coins: List[int]
:type amount: int
:rtype: int
"""
coins.sort()
res=[0x7fffffff for i in range(amount+1)]
res[0]=0
for i in range(1,amount+1):
for j in range(len(coins)):
if coins[j]<=i:
if res[i-coins[j]]!=0x7fffffff:
if res[i]>res[i-coins[j]]+1:
res[i]=res[i-coins[j]]+1
else:
break
if res[amount]==0x7fffffff:
return -1
else:
return res[amount]