coin change

Author: eunhwa99

coin-change/eunhwa99.java

@@ -0,0 +1,24 @@
+import java.util.Arrays;
+
+// 시간 복잡도: O(n * m) - n: 동전의 개수, m: 금액
+// 공간 복잡도: O(n) - dp 배열 사용
+class Solution {
+
+  public int coinChange(int[] coins, int amount) {
+    int[] dp = new int[amount + 1];
+    Arrays.fill(dp, amount + 1);
+    dp[0] = 0;
+
+    for (int i = 1; i <= amount; i++) {
+      for (int coin : coins) {
+        if (i - coin >= 0) {
+          dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+        }
+      }
+    }
+
+    return dp[amount] == amount + 1 ? -1 : dp[amount];
+  }
+}
+
+