LEECODE Algorithm 747

最新推荐文章于 2023-10-06 17:23:42 发布

QQ540205863

最新推荐文章于 2023-10-06 17:23:42 发布

阅读量193

点赞数

本文链接：https://blog.csdn.net/qq_34689452/article/details/78951683

版权

LEECODE Algorithm 747. Min Cost Climbing Stairs

题目
代码块
想法

Description

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.

Find the median of the two sorted arrays. The overall run time complexity >should be O(log (m+n)).

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

代码

#include <algorithm>
using namespace std;



class Solution {
public:

    int minCostClimbingStairs(vector<int>& cost) {
        int tank[cost.size()];
        tank[0] = cost.at(0);
        tank[1] = cost.at(1);
        if(cost.size() == 2){
            return min(tank[0],tank[1]);
        }
        for(int i = 2; i < cost.size(); i++){
            tank[i] = cost.at(i)+ min(tank[i-1],tank[i-2]);

        }
        return min(tank[cost.size()-1],tank[cost.size()-2]);
    }

};