LeetCode746 使用最小花费爬楼梯

import (
	"fmt"
	"testing"
)

func TestDpOne(t *testing.T) {
	//nums := []int{10, 15, 20}
	nums := []int{1, 100, 1, 1, 1, 100, 1, 1, 100, 1}
	fmt.Println(getDp(nums))
}

func getDp(nums []int) int {
	dp := make([]int, len(nums))
	dp[0] = nums[0]
	dp[1] = nums[1]
	for i := 2; i < len(nums); i++ {
		dp[i] = min(dp[i-1], dp[i-2]) + nums[i]
	}
	return min(dp[len(dp)-1], dp[len(dp)-2])

}