Package g3101_3200.s3101_count_alternating_subarrays

Class Solution

java.lang.Object
g3101_3200.s3101_count_alternating_subarrays.Solution
public class Solution extends Object
3101 - Count Alternating Subarrays.

Medium

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: 5

Explanation:

The following subarrays are alternating: [0], [1], [1], [1], and [0,1].

Example 2:

Input: nums = [1,0,1,0]

Output: 10

Explanation:

Every subarray of the array is alternating. There are 10 possible subarrays that we can choose.

Constraints:

  • 1 <= nums.length <= 105
  • nums[i] is either 0 or 1.

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • countAlternatingSubarrays

      public long countAlternatingSubarrays(int[] nums)