Implement the minimumCostToClimb method that finds the minimum cost needed to reach the top of the stairs.
The input contains an array cost and its length size. Each value represents the cost of stepping on that stair. You may start from step 0 or step 1, and from any step you may climb either one or two steps.
Your task is to return the minimum total cost required to reach the top, which is just after the last stair. For example, for [10,15,20], starting from step 1 costs 15 and reaches the top with the minimum cost.
Example 1
[10,15,20]315Example 2
[1,100,1,1,1,100,1,1,100,1]106Example 3
[5,10]25This problem can be solved by keeping the minimum cost needed to reach each stair.
For a stair i, you can arrive from stair i - 1 or stair i - 2. So the best cost for stair i is its own cost plus the smaller cost of those two previous positions.
After processing all stairs, the top can be reached from either of the last two stairs, so return the smaller of those two costs.
Pseudocode:
function minimumCostToClimb(cost, size):
if size == 0:
return 0
if size == 1:
return cost[0]
first = cost[0]
second = cost[1]
for i from 2 to size - 1:
current = cost[i] + min(first, second)
first = second
second = current
return min(first, second)