houseRobber.py

class Solution:
    def rob(self, nums):

        if len(nums) == 0:
            return 0

        if len(nums) == 1:
            return nums[0]

        dp = [0] * len(nums)

        dp[0] = nums[0]

        dp[1] = max(nums[0], nums[1])
      
        for i in range(2, len(dp)):
            dp[i] = max(dp[i-1], dp[i-2] + nums[i])

      
        return dp[-1]
    

nums = [1,2,3,1]
result = Solution()
output = result.rob(nums)
print(output)