198

class Solution:
def rob(self, nums):
“”"
:type nums: List[int]
:rtype: int
“”"
n = len(nums)
dp=[0]*len(nums)
if n == 0:
return 0
if n == 1:
return max(nums)
dp[0] = nums[0]
dp[1]= max(nums[0],nums[1])
for i in range(2,n):
dp[i]=max(dp[i-1],dp[i-2]+nums[i])
return dp[n-1]