美文网首页Leetcode
Leetcode 322. Coin Change

Leetcode 322. Coin Change

作者: SnailTyan | 来源:发表于2021-02-05 11:06 被阅读0次

文章作者: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/

相关文章

网友评论

    本文标题:Leetcode 322. Coin Change

    本文链接:https://www.haomeiwen.com/subject/hzdbtltx.html