LeetCode Solution, Easy, 746. Min Cost Climbing Stairs

746. Min Cost Climbing Stairs 題目敘述 You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index 0, or the step wi...