admin管理员组文章数量:1558102
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.
It's based on dp.
class Solution:
# @param num, a list of integer
# @return an integer
def rob(self, num):
if len(num) == 0:
return 0
if len(num) == 1:
return num[0]
if len(num) == 2:
return max(num[0], num[1])
dp = [0 for i in range(len(num))]
dp[0] = num[0]
dp[1] = max(num[0], num[1])
for i in range(2, len(num)):
dp[i] = max(dp[i-1], dp[i-2]+num[i])
return dp[-1]
本文标签: HouseRobberPythonLeetCode
版权声明:本文标题:198. House Robber Leetcode Python 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:https://m.elefans.com/dianzi/1727342638a1109597.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论