Add: Min Cost Climbing Stairs

Author: openset

problems/min-cost-climbing-stairs/min_cost_climbing_stairs.go

@@ -1 +1,17 @@
 package min_cost_climbing_stairs
+
+func minCostClimbingStairs(cost []int) int {
+	f1, f2, l := 0, 0, len(cost)-1
+	for i := l; i >= 0; i-- {
+		f0 := f1
+		if f2 < f1 {
+			f0 = f2
+		}
+		f0 += cost[i]
+		f1, f2 = f0, f1
+	}
+	if f1 <= f2 {
+		return f1
+	}
+	return f2
+}

problems/min-cost-climbing-stairs/min_cost_climbing_stairs_test.go

@@ -1 +1,27 @@
 package min_cost_climbing_stairs
+
+import "testing"
+
+type caseType struct {
+	input    []int
+	expected int
+}
+
+func TestMinCostClimbingStairs(t *testing.T) {
+	tests := [...]caseType{
+		{
+			input:    []int{10, 15, 20},
+			expected: 15,
+		},
+		{
+			input:    []int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1},
+			expected: 6,
+		},
+	}
+	for _, tc := range tests {
+		output := minCostClimbingStairs(tc.input)
+		if output != tc.expected {
+			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
+		}
+	}
+}