Update Solution.py

Author: yanglbme

solution/0100-0199/0198.House Robber/Solution.py

@@ -1,8 +1,9 @@
 class Solution:
     def rob(self, nums: List[int]) -> int:
-        n = len(nums)
-        f = [0] * (n + 1)
-        f[1] = nums[0]
-        for i in range(2, n + 1):
-            f[i] = max(f[i - 1], f[i - 2] + nums[i - 1])
-        return f[n]
+        @cache
+        def dfs(i: int) -> int:
+            if i >= len(nums):
+                return 0
+            return max(nums[i] + dfs(i + 2), dfs(i + 1))
+
+        return dfs(0)