#746
Min Cost Climbing Stairs
pupil · 315 · lc easy +21 · verified · 68.1% accepted · 12,327 likes · top 75%
Description
You are given an integer array cost where cost[i] is the toll for stepping on stair i. After paying the toll you may advance one or two stairs. You may begin from stair 0 or stair 1. Find and return the minimum total cost to reach the top (beyond the last stair).
Example 1:
Input: cost = [10,15,20]
Output: 15
Explanation: You will start at index 1.
- Pay 15 and climb two steps to reach the top.
The total cost is 15.
Example 2:
Input: cost = [1,100,1,1,1,100,1,1,100,1]
Output: 6
Explanation: You will start at index 0.
- Pay 1 and climb two steps to reach index 2.
- Pay 1 and climb two steps to reach index 4.
- Pay 1 and climb two steps to reach index 6.
- Pay 1 and climb one step to reach index 7.
- Pay 1 and climb two steps to reach index 9.
- Pay 1 and climb one step to reach the top.
The total cost is 6.
Code
1
2
3