zoukankan      html  css  js  c++  java
  • leetcode 746. Min Cost Climbing Stairs

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

    思路:dp[i] = min(dp[i-1]+ cost[i], dp[i-2]+cost[i])

    代码如下:

    int dp[1010];
    class Solution {
    public:
        int minCostClimbingStairs(vector<int>& cost) {
            int n = cost.size();
            memset(dp, 0x3f3f3f3f, sizeof dp);
            for (int i = 0; i < n; ++i) {
                if (i < 2) dp[i] = cost[i];
                else {
                    dp[i] = min(dp[i-2]+cost[i], dp[i-1] + cost[i]);
                }
            }
            dp[n] = min(dp[n-1], dp[n-2]);
            return dp[n];
        }
    };
    
  • 相关阅读:
    地铁开发进度1
    人月神话阅读笔记二
    学习进度五
    人月神话阅读笔记一
    WebView的用法:
    图框联动
    阅读笔记《人月神话》一
    5
    4
    3
  • 原文地址:https://www.cnblogs.com/pk28/p/8051908.html
Copyright © 2011-2022 走看看