Algobase
Problems
Get Premium
Pricing
Problems
/
746. Min Cost Climbing Stairs
Prev
Next
Visualizer
Problem
Solution
Code
[10, 15, 20]
[1, 100, 1, 1, 1, 100, 1]
[10, 15]
[10, 2, 2, 20]
⌥
Visualizer will appear here
Problem
Solution
Code
1
def min_cost_climbing_stairs(cost):
2
n = len(cost)
3
dp = [0] * (n + 1)
4
dp[0] = 0
5
dp[1] = 0
6
for i in range(2, n + 1):
7
dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2])
8
return dp[n]
Visualizer
[10, 15, 20]
[1, 100, 1, 1, 1, 100, 1]
[10, 15]
[10, 2, 2, 20]
⌥
Visualizer will appear here