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

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

    解法:使用动态规划,递推公式dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);

    1. /**
    2. * @param {number[]} cost
    3. * @return {number}
    4. */
    5. // var minCostClimbingStairs = function (cost) {
    6. // var a = 0, b = 0, min = 0;
    7. // for (let c in cost) {
    8. // b = a;
    9. // a = cost[c] + min;
    10. // min = Math.min(a, b);
    11. // }
    12. // return min;
    13. // };
    14. var minCostClimbingStairs = function (cost) {
    15. let dp = [];
    16. dp.length = cost.length;
    17. dp.fill(0);
    18. dp[0] = cost[0];
    19. dp[1] = cost[1];
    20. for (let i = 2; i < cost.length; i++) {
    21. dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);
    22. }
    23. return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
    24. };
    25. //let cost = [10, 15, 20];
    26. let cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1];
    27. console.log(minCostClimbingStairs(cost));







  • 相关阅读:
    shape与reshape
    opencv4.5.0 +contrib编译流程
    人脸定位(haar特征)
    最近邻分类法
    人脸识别概述
    跟踪视频中的物体
    估算稠密光流
    resize函数
    swap函数
    hibernate的session执行增删改查方法的执行步骤
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/8076100.html
Copyright © 2011-2022 走看看