Solved 198. House Robber using Python code

Author: KwonNayeon

house-robber/KwonNayeon.py

@@ -0,0 +1,28 @@
+"""
+Title: 198. House Robber
+
+Constraints:
+    - 1 <= nums.length <= 100
+    - 0 <= nums[i] <= 400
+
+Time Complexity:
+    - O(n)
+Space Complexity:
+    - O(n)
+"""
+
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+
+        if len(nums) == 1:
+            return nums[0]
+        elif len(nums) == 2:
+            return max(nums[0], nums[1])
+
+        dp = [0]*len(nums)
+        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 dp[-1]