1. func minCostClimbingStairs(cost []int) int {
    2.     n := len(cost)
    3.     dp := make([]int, n+1)
    4.     for i:=2;i<=n;i++{
    5.         dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
    6.     }
    7.     return dp[n]
    8. }
    10. func min(a, b int) int {
    11.     if a<b{
    12.         return a
    13.     }
    14.     return b
    15. }