leetcode.com 198. House Robber

문제 링크: https://leetcode.com/problems/house-robber

Author: skysign

leetcode.com 198. House Robber v2/main.py

@@ -0,0 +1,13 @@
+from typing import List
+
+
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        nums = [0, 0, 0] + nums
+        dp = [0 for _ in range(len(nums))]
+
+        for idx in range(3, len(nums)):
+            mx = max(dp[idx - 3], dp[idx - 2])
+            dp[idx] = mx + nums[idx]
+
+        return max(dp)

leetcode.com 198. House Robber v2/test_main.py

@@ -0,0 +1,16 @@
+from unittest import TestCase
+from main import Solution
+
+
+class TestSolution(TestCase):
+    def test1_rob(self):
+        sln = Solution()
+        self.assertEqual(
+            4, sln.rob([1,2,3,1])
+        )
+
+    def test2_rob(self):
+        sln = Solution()
+        self.assertEqual(
+            12, sln.rob([2,7,9,3,1])
+        )