题解 | 最小花费爬楼梯
最小花费爬楼梯
https://www.nowcoder.com/practice/9b969a3ec20149e3b870b256ad40844e
n = int(input())
cost=list(map(int, input().split()))
#贪心算和动态规划
dp0 = dp1 =0
for i in range(2,n+1):
dp = min(dp0+cost[i-2],dp1+cost[i-1])
dp0,dp1 = dp1,dp
print(dp1)
，就是坨屎
虾皮信息一面327人在聊
查看15道真题和解析