solve : house robber

Author: SamTheKorean

house-robber/samthekorean.py

@@ -0,0 +1,19 @@
+# TC : O(n)
+# SC : O(1)
+class Solution:
+    def rob(self, nums):
+        n = len(nums)
+        if n == 0:
+            return 0
+        if n == 1:
+            return nums[0]
+
+        dp = [-1] * n
+        dp[0] = nums[0]
+        if n > 1:
+            dp[1] = max(nums[0], nums[1])
+
+        for i in range(2, n):
+            dp[i] = max(dp[i - 1], nums[i] + dp[i - 2])
+
+        return dp[-1]