Leetcode 322. Coin Change

文章作者:Tyan
博客:noahsnail.com  |  CSDN  |  简书

1. Description

Coin Change

2. Solution

  • Version 1
class Solution:
    def coinChange(self, coins, amount):
        if amount == 0:
            return 0
        stat = [0] * (amount + 1)
        for i in range(amount + 1):
            for coin in coins:
                if i - coin > 0 and stat[i - coin] > 0:
                    if stat[i] > 0:
                        stat[i] = min(1 + stat[i - coin], stat[i])
                    else:
                        stat[i] = 1 + stat[i - coin]
                elif i - coin == 0:
                    stat[i] = 1

        return stat[amount] if stat[amount] > 0 else -1
  • Version 2
class Solution:
    def coinChange(self, coins, amount):
        if amount == 0:
            return 0
        stat = [0 if i not in coins else 1 for i in range(amount + 1)]
        for i in range(amount + 1):
            for coin in coins:
                if i - coin > 0 and stat[i - coin] > 0:
                    if stat[i] > 0:
                        stat[i] = min(1 + stat[i - coin], stat[i])
                    else:
                        stat[i] = 1 + stat[i - coin]

        return stat[amount] if stat[amount] > 0 else -1

Reference

  1. https://leetcode.com/problems/coin-change/
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值