Min Cost Climbing Stairs
Problem Statement
You are given an integer array cost where cost[i] is the cost of the i-th step on a staircase. Once you pay the cost, you can either climb one or two steps.
You can start from the step with index 0 or the step with index 1.
Return the minimum cost to reach the top of the floor (one step beyond the last index).
Input Format
A space-separated list of integers representing the cost array.
Output Format
A single integer representing the minimum cost to reach the top.
Examples
Example 1:
Input: cost = [10, 15, 20] Output: 15
Start at index 1, pay 15, and jump two steps to reach the top.
Example 2:
Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1] Output: 6
Pay costs at indices 0, 2, 4, 6, 7, 9 to reach the top with minimum cost 6.
Constraints
- 2 ≤ cost.length ≤ 1000
- 0 ≤ cost[i] ≤ 999