leetcode322 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
"""
"""
传送门:https://blog.csdn.net/qq_17550379/article/details/82909656
这实际上是一个完全背包问题，我们定义这样的方程f(amount)，
我们将n个物品放入容量为amount的背包中，使得物品金额正好为amount是，所需的硬币数目最少。
我们会考虑第i个物品放入后，所需硬币数目
f(amount)=min(f(amount-coins[i])+1)
硬币1
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
硬币2
[0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6]
硬币5
[0, 1, 1, 2, 2, 1, 2, 2, 3, 3, 2, 3]
"""
class Solution1:
    def coinChange(self, coins, amount):
        dp = [float('inf')]*(amount+1) #正无穷 float('inf') 负无穷 float('-inf')
        dp[0] = 0
        for coin in coins:
            for i in range(coin, amount+1):
                dp[i] = min(dp[i], dp[i-coin]+1)   #!!!动态规划方程，维护一个数组
        return -1 if dp[-1] > amount else dp[-1] #如果最后解出的f(amount)>amount，那么表示无解

"""
回溯法，未理解
这里我们首先将coins从大到小进行排序，这是因为我们希望硬币数量尽可能的少，
那么就需要尽量将面值大的硬币加入结果中。中间的剪枝操作也很容易理解
if coins[i] <= target < coins[i]*(result - count):
我们的目标值一定是要大于等于我们将要放入的硬币面额，而且本次使用的硬币数量一定要比上次少。
"""
class Solution2:
    def coinChange(self, coins, amount):
        coins.sort(reverse=True)
        len_coins, result = len(coins), amount+1

        def countCoins(index, target, count):
            nonlocal result
            if not target:
                result = min(result, count)

            for i in range(index, len_coins):
                if coins[i] <= target < coins[i]*(result - count):
                    countCoins(i, target - coins[i], count+1)

        for i in range(len_coins):
            countCoins(i, amount, 0)
        return -1 if result > amount else result