LeetCode --- 746. Min Cost Climbing Stairs 解题报告

杨鑫newlfe

于 2020-06-29 15:19:34 发布

阅读量321

点赞数

分类专栏：算法 Python LeetCode 文章标签： LeetCode Python 算法

本文链接：https://blog.youkuaiyun.com/u012965373/article/details/107021005

版权

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

本文是关于LeetCode中746题的解题报告，题目要求在每层楼梯有一定成本的情况下，找出到达顶层的最小花费。可以每次爬一阶或两阶，从0或1号台阶开始。文章提供了问题的解决方案和示例，并指出输入限制和数据范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

了解本专栏