动态规划问题,稍后更新思路
class Solution(object): def coinChange(self,coins,amount): """ :type coins: List[int] :type amount: int :rtype: int """ INF = float('inf') dp = [] N = len(coins) for _ in range(N): tmp = [INF] * (amount+1) tmp[0] = 0 dp.append(tmp) for j in range(1,amount+1): if j >= coins[0] and dp[0][j-coins[0]] != INF: dp[0][j] = dp[0][j-coins[0]] + 1 for i in range(1,N): for j in range(1,amount+1): if j >= coins[i]: dp[i][j] = min(dp[i - 1][j],dp[i][j-coins[i]] + 1) else: dp[i][j] = dp[i - 1][j] return dp[len(coins)- 1][amount] if dp[N-1][amount] != INF else -1
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。