We’re preparing your current view and syncing the latest data.
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 are 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.
Example: Input: nums = [1,2,3,1] Output: 4 Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). Total amount you can rob = 1 + 3 = 4.
An integer array nums representing the amount of money at each house.
An integer representing the maximum amount of money you can rob without robbing two adjacent houses.
1 <= nums.length <= 1000 0 <= nums[i] <= 400
Example 1
Input
[1,2,3,1]
Output
4
Explanation
Rob house 1 (money=1) and then house 3 (money=3) for total 4.
Example 2
Input
[2,7,9,3,1]
Output
12
Explanation
Rob house 1 money=2, house 3 money=9, and house 5 money=1 for total 12.