leetcode-198-打家劫舍

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

class Solution(object):
    def rob(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        cur_max = 0
        pre_max = 0
        for i in nums:
            temp = cur_max
            cur_max = max(pre_max + i,cur_max)
            pre_max = temp
        return cur_max