leetcode.com 322. Coin Change

문제 링크: https://leetcode.com/problems/coin-change/description/

Author: skysign

leetcode.com 322. Coin Change v2/main.py

@@ -0,0 +1,24 @@
+from typing import List
+import sys
+
+
+class Solution:
+    def coinChange(self, coins: List[int], amount: int) -> int:
+        dp: List[List[int]] = [[sys.maxsize for _ in range(amount + 1)] for _ in range(len(coins))]
+
+        for i in range(len(coins)):
+            dp[i][0] = 0
+
+        for idx_coin in range(len(coins)):
+            for idx in range(1, amount + 1):
+                if idx_coin > 0:
+                    dp[idx_coin][idx] = min(dp[idx_coin][idx], dp[idx_coin - 1][idx])
+
+                idx_prev = idx - coins[idx_coin]
+                if idx_prev >= 0:
+                    dp[idx_coin][idx] = min(dp[idx_coin][idx], dp[idx_coin][idx_prev] + 1)
+
+        if dp[len(coins) - 1][amount] == sys.maxsize:
+            return -1
+
+        return dp[len(coins) - 1][amount]

leetcode.com 322. Coin Change v2/test_main.py

@@ -0,0 +1,17 @@
+from unittest import TestCase
+from main import Solution
+
+
+class TestSolution(TestCase):
+    def test1_coin_change(self):
+        sol = Solution()
+        self.assertEqual(3, sol.coinChange([1,2,5], 11))
+
+    def test1_coin_change(self):
+        sol = Solution()
+        self.assertEqual(-1, sol.coinChange([2], 3))
+
+    def test1_coin_change(self):
+        sol = Solution()
+        self.assertEqual(0, sol.coinChange([1], 0))
+