题目描述:
https://leetcode.cn/problems/min-cost-climbing-stairs/
思路:
dp[i]:到当前楼层的最小花费
能到达当前层只有两种可能:
- 爬一层楼
- 爬两层
所以要做的就是比较两者的最低价格
dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2])
从2到n
dp[i]:从i出发到楼顶的最小花费
dp[i] = min(dp[i + 1] + cost[i], dp[i + 2] + cost[i])
从n - 3到0
代码:
1.
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n = cost.size();
vector<int> dp(n + 1, 0);
dp[0] = dp[1] = 0;
for(int i = 2;i <= n; i++)
dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
return dp[n];
}
};
2.
class Solution {
public:
int minCostClimbingStairs(vector<int>& cost) {
int n = cost.size();
vector<int> dp(n + 1, 0);
dp[n - 2] = cost[n - 2], dp[n - 1] = cost[n - 1];
for(int i = n - 3;i >= 0; i--)
dp[i] = min(dp[i + 1] + cost[i], dp[i + 2] + cost[i]);
return min(dp[0], dp[1]);
}
};