Merge pull request #2119 from CodingTestStudy2/최원준

[최원준] 2026/10/02

Author: github-actions[bot]

leetcode3/최원준/746. Min Cost Climbing Stairs.py

@@ -0,0 +1,7 @@
+class Solution:
+    def minCostClimbingStairs(self, cost: list[int]) -> int:
+        cost.append(0)
+        n = len(cost)
+        for i in range(2,n):
+            cost[i] += min(cost[i-2], cost[i-1])
+        return cost[-1]