#采用动态规划算法
class Solution(object):
def rob(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums)==0:
return 0
if len(nums)==1:
return nums[0]
Count = nums[0]
Ncount = 0
for i in range(1,len(nums)):
temp = Ncount
Ncount = max(Count,Ncount)
Count = temp + nums[i]
#print("data=",nums[i])
#print("Ncount=",Ncount)
#print("Count=",Count)
#print("\n")
return max(Ncount,Count)