[Leo] 10th Week solutions (3,4 Qs)

house-robber-ii/Leo.py

@@ -0,0 +1,16 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        n = len(nums)
+        if n == 1:
+            return nums[0]
+
+        def robrob(nums):
+            rob1, rob2 = 0, 0
+            for i in range(len(nums)):
+                rob1, rob2 = rob2, max(nums[i] + rob1, rob2)
+
+            return rob2
+
+        return max(robrob(nums[:n - 1]), robrob(nums[1:]))
+
+        ## TC: O(n), SC: O(1)

house-robber/Leo.py

@@ -0,0 +1,10 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        rob, not_rob = 0, 0
+
+        for i in nums:
+            rob, not_rob = not_rob + i, max(rob, not_rob)
+
+        return max(rob, not_rob)
+
+        ## TC: O(n), SC: O(1)