Back
1D Dynamic Programming
Question 1 of 12
8% Complete
Easy
House Robber 1D DP template
dp[i] = max(dp[i-1], dp[i-2] + nums[i]) with O(1) space.
def
rob
(nums):
prev2, prev1 =
0
,
0
for
x
in
nums:
cur =
max
(prev1,
)
prev2, prev1 = prev1, cur
return
prev1
Submit All Answers
Need a hint?
Carry two variables for dp[i-2] and dp[i-1].