746. Min Cost Climbing Stairs LeetCode Solution

In this guide, you will get 746. Min Cost Climbing Stairs LeetCode Solution with the best time and space complexity. The solution to Min Cost Climbing Stairs problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

  1. Problem Statement
  2. Complexity Analysis
  3. Min Cost Climbing Stairs solution in C++
  4. Min Cost Climbing Stairs solution in Java
  5. Min Cost Climbing Stairs solution in Python
  6. Additional Resources
746. Min Cost Climbing Stairs LeetCode Solution image

Problem Statement of 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 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.

See also  738. Monotone Increasing Digits LeetCode Solution

Constraints:

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

Complexity Analysis

  • Time Complexity: O(n)
  • Space Complexity: O(1)

746. Min Cost Climbing Stairs LeetCode Solution in C++

class Solution {
 public:
  int minCostClimbingStairs(vector<int>& cost) {
    const int n = cost.size();

    for (int i = 2; i < n; ++i)
      cost[i] += min(cost[i - 1], cost[i - 2]);

    return min(cost[n - 1], cost[n - 2]);
  }
};
/* code provided by PROGIEZ */

746. Min Cost Climbing Stairs LeetCode Solution in Java

class Solution {
  public int minCostClimbingStairs(int[] cost) {
    final int n = cost.length;

    for (int i = 2; i < n; ++i)
      cost[i] += Math.min(cost[i - 1], cost[i - 2]);

    return Math.min(cost[n - 1], cost[n - 2]);
  }
}
// code provided by PROGIEZ

746. Min Cost Climbing Stairs LeetCode Solution in Python

class Solution:
  def minCostClimbingStairs(self, cost: list[int]) -> int:
    cost.append(0)

    for i in range(2, len(cost)):
      cost[i] += min(cost[i - 1], cost[i - 2])

    return cost[-1]
 # code by PROGIEZ

Additional Resources

Happy Coding! Keep following PROGIEZ for more updates and solutions.

Similar: