feat : leetCode 비용이 적게드는 계단 오르기

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

@@ -26,4 +26,8 @@
 
 - [200. Number of Islands](https://leetcode.com/problems/number-of-islands/description/)
 - [1091. Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)
-- [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/description/)
+- [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/description/)
+
+## DP
+
+- [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)

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

@@ -0,0 +1,26 @@
+package sgyj.leetcode.yeji.section6;
+
+public class Solution746 {
+
+    public static int minCostClimbingStairs(int[] cost) {
+        int[] minCost = new int[cost.length+1];
+        int answer = 0;
+
+        for(int i=0; i<cost.length; i++){
+            minCost[i] = cost[i];
+        }
+
+        for(int i=2; i<minCost.length; i++){
+            int target1 = minCost[i] + minCost[i-1];
+            int target2 = minCost[i] + minCost[i-2];
+            minCost[i] = Math.min(target1,target2);
+        }
+
+        return minCost[minCost.length-1];
+    }
+
+    public static void main ( String[] args ) {
+        int[] cost = {1,100,1,1,1,100,1,1,100,1};
+        System.out.println(minCostClimbingStairs( cost ));
+    }
+}