feat : leetCode dp coin-change 풀이

Author: cyeji

src/main/java/sgyj/leetcode/Readme.md

@@ -30,4 +30,6 @@
 
 ## DP
 
-- [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)
+- [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)
+- [128. Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)
+- [322. Coin Change](https://leetcode.com/problems/coin-change/description/)

src/main/java/sgyj/leetcode/yeji/section6/Solution322.java

@@ -0,0 +1,23 @@
+package sgyj.leetcode.yeji.section6;
+
+import java.util.Arrays;
+
+// coin change
+public class Solution322 {
+
+    public int coinChange(int[] coins, int amount) {
+        int[] result = new int[amount+1];
+        Arrays.fill( result, Integer.MAX_VALUE - 1);
+        result[0] = 0;
+
+        for(int coin : coins){
+            for(int n = coin; n<=amount; n++){
+                int tmp = result[n-coin] + 1;
+                if(result[n]>tmp) result[n] = tmp;
+            }
+        }
+
+        return result[result.length-1] == Integer.MAX_VALUE-1 ? -1 : result[result.length-1];
+    }
+
+}