Create 322_Coin_Change.md

Author: koji

322_Coin_Change.md

@@ -0,0 +1,58 @@
+You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
+Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
+You may assume that you have an infinite number of each kind of coin.
+
+```
+Example 1:
+
+Input: coins = [1,2,5], amount = 11 
+Output: 3 
+Explanation: 11 = 5 + 5 + 1 
+Example 2: 
+
+Input: coins = [2], amount = 3 
+Output: -1 
+Example 3: 
+
+Input: coins = [1], amount = 0 
+Output: 0 
+Example 4: 
+
+Input: coins = [1], amount = 1 
+Output: 1 
+Example 5: 
+
+Input: coins = [1], amount = 2 
+Output: 2 
+ 
+
+Constraints: 
+ 
+1 <= coins.length <= 12 
+1 <= coins[i] <= 231 - 1 
+0 <= amount <= 104 
+```
+
+
+```python
+def coinChange(self, coins: List[int], amount: int) -> int:
+ 
+ dp = [float('inf')] * (amount+1)
+ dp[0] = 0
+ for c in coins:
+ for i in range(1, len(dp)):
+ 
+ if i>=c:
+ dp[i] = min(dp[i], dp[i-c]+1)
+ 
+ if dp[-1] == float('inf'):
+ return -1
+ 
+ # print(dp)
+ return dp[-1]
+```
+
+```
+Runtime: 1304 ms, faster than 58.25% of Python3 online submissions for Coin Change.
+Memory Usage: 14.6 MB, less than 53.75% of Python3 online submissions for Coin Change.
+```