Update Solution2.py

Author: yanglbme

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

@@ -1,6 +1,8 @@
 class Solution:
     def rob(self, nums: List[int]) -> int:
-        f = g = 0
-        for x in nums:
-            f, g = max(f, g), f + x
-        return max(f, g)
+        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]