1 题目
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:
cost
will have a length in the range[2, 1000]
.- Every
cost[i]
will be an integer in the range[0, 999]
.
2 尝试解
2.1 分析
爬楼梯的变形问题,可以从从第一级或第二级台阶开始,每次前进一级或两级台阶,第i级台阶所需要的成本为cost[i],问到达顶部的最小成本。
F(n)表示达到第n级台阶所需的最小成本,则有
F(n) = min(F(n-1),F(n-2))+cost[n], n > 2
2.2 代码
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
cost.push_back(0);
for(int i = 2; i < cost.size();i++){
cost[i] += min(cost[i-1],cost[i-2]);
}
return cost.back();
}
};
3 标准解
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n=(int)cost.size();
vector<int> dp(n);
dp[0]=cost[0];
dp[1]=cost[1];
for (int i=2; i<n; ++i)
dp[i]=cost[i]+min(dp[i-2],dp[i-1]);
return min(dp[n-2],dp[n-1]);
}
};