Add 746

hapiman · May 6, 2019 · May 6, 2019 · May 10, 2019 · May 10, 2019 · May 10, 2019
commit 3f5dd33c4558606f40f259f74fd48b10439a8e8d
diff --git a/Week_04/id_117/LeetCode_746_117.go b/Week_04/id_117/LeetCode_746_117.go
@@ -0,0 +1,47 @@
+package solution
+
+/*
+746. Min Cost Climbing Stairs
+
+On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
+
+Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.
+
+Example 1:
+Input: cost = [10, 15, 20]
+Output: 15
+Explanation: Cheapest is start on cost[1], pay that cost and go to the top.
+Example 2:
+Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
+Output: 6
+Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].
+Note:
+cost will have a length in the range [2, 1000].
+Every cost[i] will be an integer in the range [0, 999].
+
+*/
+
+func getSm(a, b int) int {
+	if a > b {
+		return b
+	}
+	return a
+}
+
+func minCostClimbingStairs(cost []int) int {
+	costLen := len(cost)
+	if costLen == 0 {
+		return -1
+	}
+	if costLen == 1 {
+		return cost[0]
+	}
+
+	dp := make([]int, costLen+1)
+	dp[0] = cost[0]
+	dp[1] = cost[1]
+	for i := 2; i < costLen; i++ {
+		dp[i] = getSm(dp[i-1], dp[i-2]) + cost[i]
+	}
+	return getSm(dp[costLen-1], dp[costLen-2])
+}
diff --git a/Week_04/id_117/LeetCode_746_117_test.go b/Week_04/id_117/LeetCode_746_117_test.go
@@ -0,0 +1,43 @@
+package solution
+
+import (
+	"reflect"
+	"testing"
+)
+
+/*
+Example 1:
+Input: cost = [10, 15, 20]
+Output: 15
+Explanation: Cheapest is start on cost[1], pay that cost and go to the top.
+Example 2:
+Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
+Output: 6
+Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].
+*/
+func Test_letterCasePermutation(t *testing.T) {
+	testData := []map[string]interface{}{
+		map[string]interface{}{
+			"name": "test1",
+			"ins":  []int{10, 15, 20},
+			"outs": 15,
+		},
+		map[string]interface{}{
+			"name": "test2",
+			"ins":  []int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1},
+			"outs": 6,
+		},
+	}
+	for _, tt := range testData {
+		name := tt["name"].(string)
+		ins := tt["ins"].([]int)
+		outs := tt["outs"].(int)
+		t.Run(name, func(t *testing.T) {
+			got := minCostClimbingStairs(ins)
+			eq := reflect.DeepEqual(got, outs)
+			if !eq {
+				t.Errorf("minCostClimbingStairs() = %v, want %v", got, outs)
+			}
+		})
+	}
+}