[LeetCode] 198. House Robber

- problem

198. House Robber

- 내 풀이

class Solution:
    def rob(self, nums: List[int]) -> int:
        if len(nums) < 3:
            return max(nums)

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

        return max(dp[-1], dp[-2])

- 결과