Description
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. If two adjacent houses were broken into on the same night, it will automatically contact the police. 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.
Examples
nums = [1,2,3,1]4Rob house 1 (money = 1) and then rob house 3 (money = 3). Total = 1 + 3 = 4.
nums = [2,7,9,3,1]12Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). Total = 2 + 9 + 1 = 12.
nums = [5,1,2,9]14Rob house 1 (money = 5) and house 4 (money = 9). Total = 5 + 9 = 14. This is better than robbing houses 2 and 4 (1 + 9 = 10) or houses 1 and 3 (5 + 2 = 7).
Constraints
- •
1 ≤ nums.length ≤ 100 - •
0 ≤ nums[i] ≤ 400