House Robber

House Robber

Medium

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. Adjacent houses have security systems connected - if two adjacent houses are broken into the same night, the police will be called.

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

Examples

Example 1:

Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (1) and house 3 (3).

Example 2:

Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (2), house 3 (9) and house 5 (1).

Constraints

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400
Loading...
[1,2,3,1]
4