From 848dc5d198bc6712563560839a339738eafbaf00 Mon Sep 17 00:00:00 2001
From: forest000014 <forest000014@gmail.com>
Date: Thu, 2 Jan 2025 23:08:13 +0900
Subject: [PATCH] Coin Change

---
 coin-change/forest000014.java | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 coin-change/forest000014.java

diff --git a/coin-change/forest000014.java b/coin-change/forest000014.java
new file mode 100644
index 000000000..45d4cff91
--- /dev/null
+++ b/coin-change/forest000014.java
@@ -0,0 +1,28 @@
+/* 
+Time Complexity: O(coins.length * amount)
+Space Complexity: O(amount)
+
+1 ~ i-1원까지의 최적해를 알고 있다면, i원의 최적해를 구할 때 coins 배열 iteration으로 구할 수 있음
+*/
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int c = coins.length;
+
+        int[] dp = new int[amount + 1];
+        Arrays.fill(dp, 99999);
+        dp[0] = 0;
+
+        for (int i = 1; i <= amount; i++) {
+            for (int j = 0; j < c; j++) {
+                if (i - coins[j] < 0) {
+                    continue;
+                }
+                if (dp[i - coins[j]] >= 0 && dp[i - coins[j]] + 1 < dp[i]) {
+                    dp[i] = dp[i - coins[j]] + 1;
+                }
+            }
+        }
+
+        return dp[amount] == 99999 ? -1 : dp[amount];
+    }
+}