与爬楼梯类似,
要达到当前阶层n,
可以在n-1阶层支付费用,爬一层到达,
也可以在n-2层支付费用,爬两层达到
class Solution:
def minCostClimbingStairs(self, cost):
tmp={0:0,1:0}
index=1
for index in range(2,len(cost)):
tmp[index]=min(tmp[index-1]+cost[index-1],tmp[index-2]+cost[index-2])
tmp[index+1]=min(tmp[index]+cost[index],tmp[index-1]+cost[index-1])
return tmp[index+1]