Create 746. Min Cost Climbing Stairs.py

Author: 724thomas

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]