"""
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed,
the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and
it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house,
return the maximum amount of money you can rob tonight without alerting the police.

Constraints:
    1 <= nums.length <= 100
    0 <= nums[i] <= 400
"""
from typing import List


def rob(nums: List[int]) -> int:
    loot: int = nums[0]
    prev: int = 0

    for num in nums[1:]:
        loot, prev = max(num + prev, loot), loot

    return loot


if __name__ == '__main__':
    assert rob([1, 2, 3, 1]) == 4
    assert rob([2, 7, 9, 3, 1]) == 12
