From 0078452e2010b46b64a1946b788b8537759d79f3 Mon Sep 17 00:00:00 2001
From: SinnoLn <sintmtn69@gmail.com>
Date: Fri, 2 Oct 2026 17:46:46 +0900
Subject: [PATCH] 746. Min Cost Climbing Stairs

---
 .../746. Min Cost Climbing Stairs.java"       | 30 +++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 "leetcode3/\354\235\264\354\247\204\355\235\254/746. Min Cost Climbing Stairs.java"

diff --git "a/leetcode3/\354\235\264\354\247\204\355\235\254/746. Min Cost Climbing Stairs.java" "b/leetcode3/\354\235\264\354\247\204\355\235\254/746. Min Cost Climbing Stairs.java"
new file mode 100644
index 00000000..c57526c7
--- /dev/null
+++ "b/leetcode3/\354\235\264\354\247\204\355\235\254/746. Min Cost Climbing Stairs.java"	
@@ -0,0 +1,30 @@
+/* 
+
+1. 아이디어 : 계단 1칸 or 2칸 오르고, 최소비용 구하기
+
+            dp로 직전위치까지의 최소 비용 계산후 값 반환
+
+2. 시간복잡도 : O(N)
+
+3. 자료구조/알고리즘 : DP
+
+ */
+
+class Solution {
+    public int minCostClimbingStairs(int[] cost) {
+        // 1개 or 2개
+
+        int[] dp = new int[cost.length+1];
+
+        dp[1] = cost[0];
+        dp[2] = cost[1];
+
+        for(int i=3; i<cost.length+1; i++) {
+            dp[i] = cost[i-1] + Math.min(dp[i-1], dp[i-2]);
+        }
+
+        int ans = Math.min(dp[cost.length], dp[cost.length-1]);
+
+        return ans;
+    }
+}
\ No newline at end of file