House robber on a circle
Mediumdynamic programmingarray
Like the street robber problem, but the houses form a circle: the first and last are neighbours. You can't rob two adjacent houses. Return the most you can take.
Example 1
Input: nums = [2,3,2] Output: 3
Example 2
Input: nums = [1,2,3,1] Output: 4
Constraints
- 1 ≤ nums.length ≤ 1000
- 0 ≤ nums[i] ≤ 1000
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[]} nums
* @return {int}
*/
function robCircle(nums) {
}