746. Min Cost Climbing Stairs 题解

最新推荐文章于 2020-03-28 17:42:46 发布

fdtsaid

最新推荐文章于 2020-03-28 17:42:46 发布

阅读量246

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/mozart_cai/article/details/85225305

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

leetcode.com/problems/min-cost-climbing-stairs/

minCost[n]: 达到台阶n需要消耗的最小成本
Cost[n]: 台阶n自身的成本

递推式为
minCost[n] = max( minCost[n-1] + Cost[n-1], minCost[n-2] + Cost[n-2])
minCost[0] = 0
minCost[1] = 0
minCost[2] = min(Cost[0], Cost[1])

题解样例

int minCostClimbingStairs(int* cost, int costSize) {
    int minCostTriple[3] = {0,0,0};
    int i = 0;
    
    
    for (i = 0; i < costSize+1; i++) {
        if (i == 0) {
            minCostTriple[0] = 0;
            minCostTriple[2] = 0;
            continue;
        } else if (i == 1) {
            minCostTriple[1] = 0;
            minCostTriple[2] = 0;
            continue; 
        } else if (i == 2) {
            minCostTriple[2] = cost[1] > cost[0]? cost[0] : cost[1];
            continue;
        }
        
        minCostTriple[0] = minCostTriple[1];
        minCostTriple[1] = minCostTriple[2];
        if (minCostTriple[1] + cost[i-1] < minCostTriple[0] + cost[i-2]) {
            minCostTriple[2] = minCostTriple[1] + cost[i-1];
        } else {
            minCostTriple[2] = minCostTriple[0] + cost[i-2];
        }
    }
    
    return minCostTriple[2];  
}