add: Coin Change

Author: Yongseok-Choi-dev

coin-change/YoungSeok-Choi.java

@@ -0,0 +1,17 @@
+import java.util.Arrays;
+
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int[] memo = new int[amount + 1];
+        Arrays.fill(memo, amount + 1); // 도달 불가능한 초기값
+        memo[0] = 0; // 0원을 만들기 위한 동전 수는 0개
+
+        for (int coin : coins) {
+            for (int i = coin; i <= amount; i++) {
+                memo[i] = Math.min(memo[i], memo[i - coin] + 1);
+            }
+        }
+
+        return memo[amount] > amount ? -1 : memo[amount];
+    }
+}

word-search/YoungSeok-Choi.java

@@ -117,4 +117,4 @@ public void dfs(char[][] b, int x, int y) {
                 dfs(b, nx, ny);
             }
         }
-    }}
+    }}