LeetCode 746. Min Cost Climbing Stairs (Python)最优解--Apolo_Shane
2018-01-24 17:23
791 查看
是198题. House Robber 的反例子
# 1/小偷抢的越多,其剩下的就越少,其目标就是剩下的最少,但是不能连偷两个,这样的话会造成梯子有隔断。
# 2/小偷不能偷相邻的,正好是梯子不能跳两格对应上
class Solution:
def minCostClimbingStairs(self, cost):
last=now=0
for i in cost:
last,now=now,max(i+last,now)
return sum(cost)-now
相关文章推荐
- [LeetCode] 746. Min Cost Climbing Stairs
- leetcode 746. Min Cost Climbing Stairs 走台阶问题 + 斐波拉契序列 + 动态规划DP
- leetcode 746. Min Cost Climbing Stairs
- LeetCode 62. Unique Paths (Python)最优解--Apolo_Shane
- [Leetcode] 746. Min Cost Climbing Stairs 解题报告
- 746. Min Cost Climbing Stairs[Leetcode从零开刷]
- LeetCode 746. Min Cost Climbing Stairs(动态规划)
- Leetcode 746. Min Cost Climbing Stairs 最小成本爬楼梯 (动态规划)
- Dynamic Programing -- Leetcode problem 746. Min Cost Climbing Stairs
- Leetcode 746. Min Cost Climbing Stairs 最小成本爬楼梯 (动态规划)
- LeetCode 746. Min Cost Climbing Stairs
- LeetCode-746. Min Cost Climbing Stairs
- LeetCode 64. Minimum Path Sum (Python)最优解--Apolo_Shane
- LeetCode 96. Unique Binary Search Trees (Python)最优解--Apolo_Shane
- Leetcode 746. Min Cost Climbing Stairs
- LeetCode746. Min Cost Climbing Stairs
- LeetCode 120. Triangle (Python)最优解--Apolo_Shane
- [LeetCode] 746. Min Cost Climbing Stairs
- 【LeetCode】746. Min Cost Climbing Stairs 解题报告
- LeetCode | 746. Min Cost Climbing Stairs | 简单DP上楼梯问题