zoukankan      html  css  js  c++  java
  • Python3解leetcode 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].
    

    Note:

    1. cost will have a length in the range [2, 1000].
    2. Every cost[i] will be an integer in the range [0, 999].

    思路:

    考虑动态规划算法,依次遍历每一个元素,都计算包含该元素和不包含该元素的结果。

    代码:

    1 class Solution:
    2     def minCostClimbingStairs(self, cost: List[int]) -> int:
    3         notadd , add = 0 , 0
    4         for i in cost:
    5             notadd , add = add , i + min(notadd, add)
    6         return min(notadd , add)
  • 相关阅读:
    图片上传
    解决Vuex持久化插件-在F5刷新页面后数据不见的问题
    vue登录
    拖动排序的vue组件
    vue图片懒加载
    vue中使用图片预加载
    前端架构知识体系
    html判断IE版本
    HighCharts 在IE8下饼图不显示的问题
    新一代调试王者Console
  • 原文地址:https://www.cnblogs.com/xiaohua92/p/11572609.html
Copyright © 2011-2022 走看看