当前位置：网站首页>leetcode746. Climb stairs with minimum cost (simple)

leetcode746. Climb stairs with minimum cost (simple)

2022-04-22 14:48:00 【Heavy garbage】

Insert picture description here
Insert picture description here
Insert picture description here
It's similar to the idea of climbing stairs .
leetcode70. climb stairs （ Simple ）：https://blog.csdn.net/zhangjiaji111/article/details/121801918

Ideas ：dp
dp[i] To i The lowest cost of the steps in the position
dp[n]=min(dp[n-1]+cost[n-1],dp[n-2]+cost[n-2])
The border ：dp[0] = dp[1] = 0;

class Solution {
    
public:
    int minCostClimbingStairs(vector<int>& cost) {
    
 
        int n = cost.size();
        vector<int> dp(n + 1);
        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];
    }
};

版权声明
本文为[Heavy garbage]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204221445202983.html

边栏推荐

猜你喜欢

随机推荐