feat: Solve house-robber-ii problem

Author: hu6r1s

house-robber-ii/hu6r1s.py

@@ -0,0 +1,12 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        return max(nums[0], self.helper(nums[1:]), self.helper(nums[:-1]))
+
+
+    def helper(self, nums):
+        rob1, rob2 = 0, 0
+        for num in nums:
+            new_rob = max(rob1 + num, rob2)
+            rob1 = rob2
+            rob2 = new_rob
+        return rob2