Add go solution for 746. Min Cost Climbing Stairs

746. Min Cost Climbing Stairs: https://leetcode.com/problems/min-cost-climbing-stairs/

Author: ckclark

go/min-cost-climbing-stairs.go

@@ -0,0 +1,16 @@
+package leetcode
+
+func minCostClimbingStairs(cost []int) int {
+	size := len(cost)
+	prev2, prev1, prev0 := 0, 0, 0
+	for i := 2; i <= size; i++ {
+		n1, n2 := prev2+cost[i-2], prev1+cost[i-1]
+		if n1 > n2 {
+			prev0 = n2
+		} else {
+			prev0 = n1
+		}
+		prev2, prev1 = prev1, prev0
+	}
+	return prev0
+}

go/min-cost-climbing-stairs_test.go

@@ -0,0 +1,12 @@
+package leetcode
+
+import "testing"
+
+func TestMinCostClimbingStairs(t *testing.T) {
+	if minCostClimbingStairs([]int{10, 15, 20}) != 15 {
+		t.Fatal()
+	}
+	if minCostClimbingStairs([]int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1}) != 6 {
+		t.Fatal()
+	}
+}