322-Coin-Change
Sat 17 May 2025
https://leetcode.com/problems/coin-change
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def coinChange(self, coins: List[int], amount: int) -> int:
# dp[i] := fewest # Of coins to make up i
dp = [0] + [amount + 1] * amount
for coin in coins:
for i in range(coin, amount + 1):
dp[i] = min(dp[i], dp[i - coin] + 1)
return -1 if dp[amount] == amount + 1 else dp[amount]
new Solution().coinChange()
Score: 5
Category: leetcode