Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f730a7a

Browse files
Create min-cost-climbing-stairs.go
1 parent b07b9a8 commit f730a7a

File tree

1 file changed

+18
-0
lines changed

1 file changed

+18
-0
lines changed
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
//https://leetcode.com/problems/min-cost-climbing-stairs/
2+
3+
package min_cost_climbing_stairs
4+
5+
func minCostClimbingStairs(cost []int) int {
6+
dp := make([]int, len(cost)+1)
7+
for i := 2; i <= len(cost); i++ {
8+
dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
9+
}
10+
return dp[len(cost)]
11+
}
12+
13+
func min(a int, b int) int {
14+
if a < b {
15+
return a
16+
}
17+
return b
18+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /