leedcode
python
c++
medium
DP
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system 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:
Example 2:
Example 3:
Constraints:
1 <= nums.length <= 100
0 <= nums[i] <= 1000
Complexity
n = nums.length
Time Complexity Space Complexity Solution 1 O(n) O(n) Solution 1 O(n) O(1)
sol1:
既然是排成一圈, 那就選一間房子為頭或是尾巴, 選第0間房子最方便