Count Alternating Subarrays
You are given a binary array nums.
We call a subarray alternating if no two adjacent elements in the subarray have the same value.
Return the number of alternating subarrays in nums.
Example 1
Input
nums = [0,1,1,1]Output
5The following subarrays are alternating:
[0], [1], [1], [1], and [0,1].Example 2
Input
nums = [1,0,1,0]Output
10Every subarray of the array is alternating, so there are 10 possible subarrays that can be chosen.
Constraints
- 1 <= nums.length <= 10^5
- nums[i] is either 0 or 1.