Commit 5ba6056

committed

leetcode min cost climbing stairs solution and test

1 parent f464b87 commit 5ba6056Copy full SHA for 5ba6056

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+// https://leetcode.com/problems/min-cost-climbing-stairs/`
	`2`	`+package min_cost_climbing_stairs`
	`3`	`+`
	`4`	`+func minCostClimbingStairs(cost []int) int {`
	`5`	`+ n := len(cost)`
	`6`	`+`
	`7`	`+ dp := make([]int, n+1)`
	`8`	`+ dp[n] = 0`
	`9`	`+ dp[n-1] = cost[n-1]`
	`10`	`+`
	`11`	`+ for i := n - 2; i >= 0; i-- {`
	`12`	`+ dp[i] = cost[i] + min(dp[i+1], dp[i+2])`
	`13`	`+ }`
	`14`	`+`
	`15`	`+ return min(dp[0], dp[1])`
	`16`	`+}`
	`17`	`+`
	`18`	`+func min(i, j int) int {`
	`19`	`+ if i > j {`
	`20`	`+ return j`
	`21`	`+ }`
	`22`	`+ return i`
	`23`	`+}`

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+package min_cost_climbing_stairs`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+func Test_minCostClimbingStairs(t *testing.T) {`
	`6`	`+ cases := []struct {`
	`7`	`+ num []int`
	`8`	`+ expected int`
	`9`	`+ }{`
	`10`	`+ {[]int{10, 15, 20}, 15},`
	`11`	`+ {[]int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1}, 6},`
	`12`	`+ }`
	`13`	`+`
	`14`	`+ for idx, tc := range cases {`
	`15`	`+ res := minCostClimbingStairs(tc.num)`
	`16`	`+ if tc.expected != res {`
	`17`	`+ t.Errorf("case %d. expecting %d, got %d", idx, tc.expected, res)`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+}`

Comments

(0)