feat: [dp]

Author: chen-shiwei

leetcode/70.爬楼梯/climbStairs.go

@@ -0,0 +1,15 @@
+package _70_爬楼梯
+
+func climbStairs(n int) int {
+	if n < 3 {
+		return n
+	}
+	var dp = make([]int, n+1)
+	dp[1] = 1
+	dp[2] = 2
+
+	for i := 3; i <= n; i++ {
+		dp[i] = dp[i-1] + dp[i-2]
+	}
+	return dp[n]
+}

leetcode/70.爬楼梯/climbStairs_test.go

@@ -0,0 +1,23 @@
+package _70_爬楼梯
+
+import "testing"
+
+func Test_climbStairs(t *testing.T) {
+	type args struct {
+		n int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{name: ``, args: args{n: 3}, want: 3},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := climbStairs(tt.args.n); got != tt.want {
+				t.Errorf("climbStairs() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

leetcode/746.使用最小花费爬楼梯/minCostClimbingStairs.go

@@ -0,0 +1,24 @@
+package _746_使用最小花费爬楼梯
+
+func minCostClimbingStairs(cost []int) int {
+	var (
+		l  = len(cost)
+		dp = make([]int, l)
+	)
+
+	dp[0] = cost[0]
+	dp[1] = cost[1]
+	for i := 2; i < l; i++ {
+		dp[i] = min(dp[i-1], dp[i-2]) + cost[i]
+	}
+
+	return min(dp[l-1], dp[l-2])
+}
+
+func min(a, b int) int {
+	if a > b {
+		return b
+
+	}
+	return a
+}

leetcode/746.使用最小花费爬楼梯/minCostClimbingStairs_test.go

@@ -0,0 +1,24 @@
+package _746_使用最小花费爬楼梯
+
+import "testing"
+
+func Test_minCostClimbingStairs(t *testing.T) {
+	type args struct {
+		cost []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{name: `输入：cost = [10, 15, 20] 输出：15`, args: args{cost: []int{10, 15, 20}}, want: 15},
+		{name: `输入：cost = [1,100,1,1,1,100,1,1,100,1] 输出：15`, args: args{cost: []int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1}}, want: 6},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := minCostClimbingStairs(tt.args.cost); got != tt.want {
+				t.Errorf("minCostClimbingStairs() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}