[LC] 746. Min Cost Climbing Stairs
Posted xuanlu
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LC] 746. 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].
class Solution { public int minCostClimbingStairs(int[] cost) { if (cost.length == 1) { return cost[0]; } if (cost.length == 2) { return Math.min(cost[0], cost[1]); } int cur = 0, res = 0; int twoBefore = cost[0], oneBefore = cost[1]; for (int i = 2; i < cost.length; i++) { cur = Math.min(twoBefore, oneBefore) + cost[i]; twoBefore = oneBefore; oneBefore = cur; } return Math.min(twoBefore, oneBefore); } }
以上是关于[LC] 746. Min Cost Climbing Stairs的主要内容,如果未能解决你的问题,请参考以下文章
746. Min Cost Climbing Stairs@python
Min Cost Climbing Stairs [746]