deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-13 14:57:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Time: 0 ms (100%), Space: 12.4 MB (55.59%) - LeetHub

Browse Source
This commit is contained in:
Deven
2025-09-10 21:25:29 -04:00
parent f5afe43473
commit 7b14031af0
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
0198-house-robber/0198-house-robber.py
+4 -3
View File
@@ -9,7 +9,7 @@ class Solution(object):
return max(nums) return max(nums)
# Subproblem: only nums 0 to i exist and i is always robbed # Subproblem: only nums 0 to i exist and i is always robbed
dp = [0] * len(nums) dp = [0] * 3 # Optimized to only hold the last 3 entries
dp[0] = nums[0] dp[0] = nums[0]
dp[1] = nums[1] dp[1] = nums[1]
@@ -17,7 +17,8 @@ class Solution(object):
for i in range(3, len(nums)): for i in range(3, len(nums)):
dp[i] = nums[i] + max(dp[i - 2], dp[i - 3]) x = i % 3
dp[x] = nums[i] + max(dp[(x - 2) % 3], dp[x])
return max(dp[-1], dp[-2]) return max(dp)