leetcode

class :
    def rob(self, nums: List[int]) -> int:
        if (len(nums) == 0):
            return 0
        elif (len(nums) == 1):
            return nums[0]
        elif (len(nums) == 2):
            return max(nums)
        else:
            res = [0] * len(nums)
            res[0] = nums[0]
            res[1] = max(nums[:2])
            for i in range(2, len(nums)):
                
                # 选择利用较大的结果。
                res[i] = max(nums[i] + res[i-2], res[i-1])
            return res[-1]