g0301_0400.s0322_coin_change.Solution.py Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
# #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
# #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
# #2024_06_08_Time_488_ms_(96.38%)_Space_16.9_MB_(86.07%)

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        dp = [0] * (amount + 1)
        dp[0] = 1
        
        for coin in coins:
            for i in range(coin, amount + 1):
                prev = dp[i - coin]
                if prev > 0:
                    if dp[i] == 0:
                        dp[i] = prev + 1
                    else:
                        dp[i] = min(dp[i], prev + 1)
        
        return dp[amount] - 1 if dp[amount] > 0 else -1