1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22

// @Title: 使用最小花费爬楼梯 (Min Cost Climbing Stairs)
// @Author: 15816537946@163.com
// @Date: 2020-12-21 09:27:10
// @Runtime: 4 ms
// @Memory: 3 MB
func minCostClimbingStairs(cost []int) int {
	n := len(cost)
	dp := make([]int, n+1)
	for i := 2; i < n+1; i++ {
		dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
	}
	return dp[n]

}

func min(a, b int) int {
	if a > b {
		return b
	}
	return a
}