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.
Example 1:
Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.
Example 2:
Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.
解析:
- 只有1个房屋nums[0],最大收益为dp[0] = nums[0];
- 有2个房屋nums[0], nums[1], 不能同时取,最大收益为dp[1] = max(nums[0], nums[1]);
- 有3个房屋,有两种取法,取nums[1],或者取nums[0]和nums[2].即 dp[2] = max(nums[1], nums[0] + nums[2]);
- 故可推测出动态转换方程为:dp[i] = max(nums[i] + dp[i-2], dp[i-1]);
class Solution(object):
def rob(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
n=len(nums)
dp=[0]*n
if n==0:
return 0
if n==1:
return nums[0]
if n==2:
return max(nums[0],nums[1])
dp[0]=nums[0]
dp[1]=max(nums[0],nums[1])
for i in range(2,n):
dp[i]=max(dp[i-1],nums[i]+dp[i-2])
return dp[n-1]