-
Notifications
You must be signed in to change notification settings - Fork 0
/
746.min-cost-climbing-stairs.ts
76 lines (75 loc) · 1.69 KB
/
746.min-cost-climbing-stairs.ts
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
74
75
76
/*
* @lc app=leetcode id=746 lang=typescript
*
* [746] Min Cost Climbing Stairs
*
* https://leetcode.com/problems/min-cost-climbing-stairs/description/
*
* algorithms
* Easy (59.68%)
* Likes: 6328
* Dislikes: 1091
* Total Accepted: 513.3K
* Total Submissions: 859.7K
* Testcase Example: '[10,15,20]'
*
* You are given an integer array cost where cost[i] is the cost of i^th step
* on a staircase. Once you pay the cost, you can either climb one or two
* steps.
*
* You can either start from the step with index 0, or the step with index 1.
*
* Return the minimum cost to reach the top of the floor.
*
*
* Example 1:
*
*
* Input: cost = [10,15,20]
* Output: 15
* Explanation: You will start at index 1.
* - Pay 15 and climb two steps to reach the top.
* The total cost is 15.
*
*
* Example 2:
*
*
* Input: cost = [1,100,1,1,1,100,1,1,100,1]
* Output: 6
* Explanation: You will start at index 0.
* - Pay 1 and climb two steps to reach index 2.
* - Pay 1 and climb two steps to reach index 4.
* - Pay 1 and climb two steps to reach index 6.
* - Pay 1 and climb one step to reach index 7.
* - Pay 1 and climb two steps to reach index 9.
* - Pay 1 and climb one step to reach the top.
* The total cost is 6.
*
*
*
* Constraints:
*
*
* 2 <= cost.length <= 1000
* 0 <= cost[i] <= 999
*
*
*/
// @lc code=start
function minCostClimbingStairs(cost: number[]): number {
const n = cost.length;
let last1 = 0,
last2 = 0,
result = 0;
if (n == 2) {
return Math.min(cost[0], cost[1]);
}
for (let i = 2; i <= n; i++) {
result = Math.min(last2 + cost[i - 2], last1 + cost[i - 1]);
last2 = last1;
last1 = result;
}
return result;
}
// @lc code=end