Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 921773c

Browse files
authored
Added solution in Python for Min CostClimbingStai
1 parent 7a3115f commit 921773c

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed

‎Leetcode/Min_Cost_Climbing_Stairs.py

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
class Solution:
2+
def minCostClimbingStairs(self, cost: List[int]) -> int:
3+
prev2, prev1 = 0, 0
4+
for i in range(2, len(cost) + 1):
5+
curr = min(prev2 + cost[i - 2], prev1 + cost[i - 1])
6+
prev2, prev1 = prev1, curr
7+
return prev1

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /