Package g3101_3200.s3101_count_alternating_subarrays

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • nums[i] is either 0 or 1.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long countAlternatingSubarrays(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait