done

Author: megha-66

dynamic_programming/house_robber.py

@@ -19,17 +19,15 @@
 
 """
 
-
-
-def rob(nums:list[int]) -> int:
+def rob(nums: list[int]) -> int:
     n = len(nums)
-    if n < 3 :
+    if n < 3:
         return max(nums)
-    dp = [0]*n
+    dp = [0] * n
     dp[0] = nums[0]
     dp[1] = max(nums[0], nums[1])
-    for i in range(2,n):
-        dp[i] = max(nums[i]+dp[i-2], dp[i-1])
+    for i in range(2, n):
+        dp[i] = max(nums[i] + dp[i - 2], dp[i - 1])
     return max(dp)