Leetcode 198 Solution

This article provides solution to leetcode question 198 (house-robber)
Categories:
Tags:
Access this page by simply typing in "lcs 198" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/house-robber

Solution

class Solution:
    def rob(self, nums: List[int]) -> int:
        n = len(nums)



        if n == 1:
            return nums[0]



        dp = [0] * n



        dp[0] = nums[0]
        dp[1] = max(nums[0], nums[1])



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



        return max(dp)