House Robber
Medium
Array
Dynamic Programming
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

Constraints

  • 1 <= nums.length <= 100
  • 0 <= nums[i] <= 400
Time Complexity
O(n)
Space Complexity
O(1)
14
Case 1
Input: [1,2,3,1]
Expected: 4
Case 2
Input: [2,7,9,3,1]
Expected: 12
Case 3
Input: [2,1,1,2]
Expected: 4