• Home
• com.github.javadev
• leetcode-in-java11
• 1.19
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0701_0800.s0746_min_cost_climbing_stairs.readme.md Maven / Gradle / Ivy

746\. Min Cost Climbing Stairs

Easy

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 with index `1`.

Return _the minimum cost to reach the top of the floor_.

**Example 1:**

**Input:** cost = [10,15,20]

**Output:** 15

**Explanation:** You will start at index 1. - Pay 15 and climb two steps to reach the top. The total cost is 15.

**Example 2:**

**Input:** cost = [1,100,1,1,1,100,1,1,100,1]

**Output:** 6

**Explanation:** You will start at index 0. 

- Pay 1 and climb two steps to reach index 2. 
- Pay 1 and climb two steps to reach index 4. 
- Pay 1 and climb two steps to reach index 6. 
- Pay 1 and climb one step to reach index 7. 
- Pay 1 and climb two steps to reach index 9. 
- Pay 1 and climb one step to reach the top. 
  The total cost is 6.

**Constraints:**

*   `2 <= cost.length <= 1000`
*   `0 <= cost[i] <= 999`