Skip to content

Latest commit

 

History

History
31 lines (21 loc) · 860 Bytes

README.md

File metadata and controls

31 lines (21 loc) · 860 Bytes

123.Min Cost Climbing Stairs

Description

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). 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.

Note

  • cost will have a length in the range [2, 1000].
  • Everycost[i] will be an integer in the range [0, 999].

Example1

Input: cost = [10, 15, 20]
Output: 15
Explanation: Cheapest is start on cost[1], pay that cost and go to the top.

Example2

Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
Output: 6
Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].

From

LeetCode