-
Notifications
You must be signed in to change notification settings - Fork 2
/
746.使用最小花费爬楼梯.html
73 lines (62 loc) · 2.18 KB
/
746.使用最小花费爬楼梯.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>746. 使用最小花费爬楼梯</title>
</head>
<body>
<script>
// https://leetcode.cn/problems/min-cost-climbing-stairs/
// 给你一个整数数组 cost ,其中 cost[i] 是从楼梯第 i 个台阶向上爬需要支付的费用。一旦你支付此费用,即可选择向上爬一个或者两个台阶。
// 你可以选择从下标为 0 或下标为 1 的台阶开始爬楼梯。
// 请你计算并返回达到楼梯顶部的最低花费。
// 提示:
// 2 <= cost.length <= 1000
// 0 <= cost[i] <= 999
/**
* @param {number[]} cost
* @return {number}
*/
var minCostClimbingStairs = function (cost) {};
// --- answer-1 ---
// 动态规划
// mim: dp[i-1] + cost[i-1], dp[i-2] + cost[i-2]
var minCostClimbingStairs = function (cost = []) {
const dp = [0, 0];
cost.push(0);
for (let i = 2; i < cost.length; i++) {
dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
}
console.log('dp = ', dp);
return dp[dp.length - 1];
};
// 优化空间复杂度
var minCostClimbingStairs = function (cost = []) {
cost.push(0);
let p_pre = 0,
pre = 0,
cur = 0;
for (let i = 2; i < cost.length; i++) {
cur = Math.min(pre + cost[i - 1], p_pre + cost[i - 2]);
p_pre = pre;
pre = cur;
}
return cur;
};
// --- answer-1 ---
// --- answer-2 ---
// --- answer-2 ---
var cost = [10, 15, 20];
var result = 15;
// 解释:你将从下标为 1 的台阶开始。
// var cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1];
// var result = 6;
// 解释:你将从下标为 0 的台阶开始。
console.log('cost = ', cost);
console.log('result = ', result);
console.log('minCostClimbingStairs = ', minCostClimbingStairs(cost));
</script>
</body>
</html>