Package g0701_0800.s0746_min_cost_climbing_stairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    746 - Min Cost Climbing Stairs.

    Easy

    You are given an integer array cost where cost[i] is the cost of <code>i<sup>th</sup></code> 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,<ins>15</ins>,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 = <ins>1</ins>,100,<ins>1</ins>,1,<ins>1</ins>,100,<ins>1</ins>,<ins>1</ins>,100,<ins>1</ins>

    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 &lt;= cost.length &lt;= 1000

    • 0 &lt;= cost[i] &lt;= 999

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minCostClimbingStairs(IntArray cost)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait