1 minute read

198. House Robber

문제 링크

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

문제 설명

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

제한 사항

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400

입출력 예 #1

  1. Input : nums = [1,2,3,1]
  2. Output : 4
  3. Explanation : Rob house 1 (money = 1) and then rob house 3 (money = 3). Total amount you can rob = 1 + 3 = 4.

입출력 예 #2

  1. Input : nums = [2,7,9,3,1]
  2. Output : 12
  3. Explanation : Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). Total amount you can rob = 2 + 9 + 1 = 12.

문제 풀이

  1. 재귀 구조 브루트 포스 (타임아웃)
  2. 타뷸레이션
class Solution:
    def rob(self, nums: List[int]) -> int:
        def _rob(i: int) -> int:
            if i < 0 :
                return 0
            return max(_rob(i - 1), _rob(i - 2) + nums[i])
        return _rob(len(nums) - 1)

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

        dp = collections.OrderedDict()
        dp[0], dp[1] = nums[0], max(nums[0], nums[1])

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

        return dp.popitem()[1]

Comments

You May Also Enjoy