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 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.
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 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.
Example 1
Input: nums = [1,2,3,1] Output: 4
Example 2
Input: nums = [2,7,9,3,1] Output: 12
Show hint
Use DP: rob[i] = max(rob[i-1], rob[i-2] + nums[i]). Either skip current house (take previous max) or rob current + max from 2 houses ago.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
[1,2,3,1]
4