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

    1. Question:

    746. Min Cost Climbing Stairs

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

    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.

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

    2. Solution:
    class Solution:
        def minCostClimbingStairs(self, cost):
            """
            :type cost: List[int]
            :rtype: int
            """
            if cost is None or len(cost) <= 1:
                return 0
    
            size = len(cost)
    
            if size == 2:
                return min(cost[0], cost[1])
    
            cost_bf = cost[0]
            cost_cur = cost[1]
            for i in range(2, size):
                tmp = min(cost_cur + cost[i], cost_bf + cost[i])
                cost_bf = cost_cur
                cost_cur = tmp
            return min(cost_cur, cost_bf)

    3. Complexity Analysis

    Time Complexity : O(N)

    Space Complexity: O(1)

  • 相关阅读:
    C语言 assert 函数
    C语言 exit 函数
    C语言 main 函数参数 main(int argc, char *argv[])
    《一线架构师实践指南》读后感(一)
    机器学习十讲第八讲
    机器学习十讲第七讲
    Python通过IMAP实现邮箱客户端
    ABAP-PS操作
    ABAP-AES加解密
    ABAP-HmacSHA256
  • 原文地址:https://www.cnblogs.com/ordili/p/9992116.html
Copyright © 2011-2022 走看看