GoLang Solution For LeetCode Problem: Min Cost Climbing Stairs
Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.
Input: cost = [10, 15, 20] Output: 15 Explanation: Cheapest is start on cost, pay that cost and go to the top.
Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1] Output: 6 Explanation: Cheapest is start on cost, and only step on 1s, skipping cost.
See the full details of the problem Min Cost Climbing Stairs at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go