Min Cost Climbing Stairs

Posted amazingzoe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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     public int minCostClimbingStairs(int[] cost) {
 3         int n = cost.length;
 4         int num1 = cost[0], num2 = cost[1];
 5         
 6         for (int i = 2; i < n; i++) {
 7             int temp = Math.min(num1, num2) + cost[i];
 8             num1 = num2;
 9             num2 = temp;
10         }
11         
12         return Math.min(num1, num2);
13     }
14 }

 

 1 class Solution {
 2     public int minCostClimbingStairs(int[] cost) {
 3         int n = cost.length;
 4         int minCost[] = new int[n];
 5         minCost[0] = cost[0];
 6         minCost[1] = cost[1];
 7         
 8         for (int i = 2; i < n; i++) {
 9             minCost[i] = Math.min(minCost[i - 2], minCost[i - 1]) + cost[i];
10         }
11         
12         return Math.min(minCost[n - 2], minCost[n - 1]);
13     }
14 }

 

以上是关于Min Cost Climbing Stairs的主要内容,如果未能解决你的问题,请参考以下文章

Min Cost Climbing Stairs

746. Min Cost Climbing Stairs@python

746. Min Cost Climbing Stairs

[LeetCode] Min Cost Climbing Stairs

[LC] 746. Min Cost Climbing Stairs

746. Min Cost Climbing Stairs(动态规划)