#101 Medium Time O(n) Space O(1) Animated

House Robber

Maximize robbery money without robbing adjacent houses.

LeetCode ↗

Approach: Dynamic Programming (1D)

Click play to start

Step 0 / 0

Press play to start the visualization.

1×

Description

Maximize robbery money without robbing adjacent houses.

Constraints

Time Complexity: O(n)
Space Complexity: O(1)

Solution — Dynamic Programming (1D)

O(n) O(1)

def rob(nums):
    rob1, rob2 = 0, 0
    
    # [rob1, rob2, n, n+1, ...]
    for n in nums:
        temp = max(n + rob1, rob2)
        rob1 = rob2
        rob2 = temp
    return rob2

Min Cost Climbing Stairs

House Robber II

House Robber

Steps

Description

Constraints

Tags

Solution — Dynamic Programming (1D)