Minimum Operations to Make the Array Alternating
You are given a 0-indexed array nums consisting of n positive integers.
The array nums is called alternating if:
nums[i - 2] == nums[i], where2 <= i <= n - 1.nums[i - 1] != nums[i], where1 <= i <= n - 1.
In one operation, you can choose an index i and change nums[i] into any positive integer.
Return the minimum number of operations required to make the array alternating.
Example 1
Input
nums = [3,1,3,2,4,3]Output
3One way to make the array alternating is by converting it to [3,1,3,1,3,1], which requires 3 operations, and it is not possible to do better.
Example 2
Input
nums = [1,2,2,2,2]Output
2One way to make the array alternating is by converting it to [1,2,1,2,1], which requires 2 operations, and converting to [2,2,2,2,2] would violate the alternating conditions.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^5