You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, and the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected — if two adjacent houses are broken into on the same night, the police will be alerted.
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.
nums = [1,2,3,1]4nums = [2,7,9,3,1]12nums = [2,1,1,2]41 <= nums.length <= 1000 <= nums[i] <= 400Expected time complexity: O(n)Run your code to see results
Use Cmd+Enter to run