Leetcode Problem 746. Min Cost Climbing Stairs

746. Min Cost Climbing Stairs

Leetcode Solutions

Initialize an array minimumCost with a length of cost.length + 1, and set the first two elements to 0 (base cases).
Iterate over the array starting from the third element (index 2).
For each step i, calculate minimumCost[i] using the recurrence relation: minimumCost[i] = min(minimumCost[i - 1] + cost[i - 1], minimumCost[i - 2] + cost[i - 2]).
After filling the table, return the last element of minimumCost, which represents the minimum cost to reach the top of the floor.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen