Formatted question description: https://leetcode.ca/all/746.html

# 746. Min Cost Climbing Stairs (Easy)

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.

Example 1:

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


Example 2:

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].


Note:

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

Companies:
Amazon

Related Topics:
Array, Dynamic Programming

Similar Questions:

## Solution 1. DP

// OJ: https://leetcode.com/problems/min-cost-climbing-stairs/

// Time: O(N)
// Space: O(1)
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int prev = 0, cur = 0;
for (int i = 2; i <= cost.size(); ++i) {
int newCur = min(cur + cost[i - 1], prev + cost[i - 2]);
prev = cur;
cur = newCur;
}
return cur;
}
};


Java

class Solution {
public int minCostClimbingStairs(int[] cost) {
int length = cost.length;
int[] dp = new int[length + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= length; i++)
dp[i] = Math.min(dp[i - 2] + cost[i - 2], dp[i - 1] + cost[i - 1]);
return dp[length];
}
}