House Robber
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 house 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 in each house, return the maximum amount of money you can rob tonight without alerting the police.
Example 1
Input
nums = [1,2,3,1]Output
4Rob house 1 with money 1 and house 3 with money 3, for a total of 4.
Example 2
Input
nums = [2,7,9,3,1]Output
12Rob house 1 with money 2, house 3 with money 9, and house 5 with money 1, for a total of 12.
Constraints
- 1 <= nums.length <= 100
- 0 <= nums[i] <= 400