Package g3201_3300.s3208_alternating_groups_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3208 - Alternating Groups II.

    Medium

    There is a circle of red and blue tiles. You are given an array of integers colors and an integer k. The color of tile i is represented by colors[i]:

    • colors[i] == 0 means that tile i is red.

    • colors[i] == 1 means that tile i is blue.

    An alternating group is every k contiguous tiles in the circle with alternating colors (each tile in the group except the first and last one has a different color from its left and right tiles).

    Return the number of alternating groups.

    Note that since colors represents a circle , the first and the last tiles are considered to be next to each other.

    Example 1:

    Input: colors = 0,1,0,1,0, k = 3

    Output: 3

    Explanation:

    Alternating groups:

    Example 2:

    Input: colors = 0,1,0,0,1,0,1, k = 6

    Output: 2

    Explanation:

    Alternating groups:

    Example 3:

    Input: colors = 1,1,0,1, k = 4

    Output: 0

    Explanation:

    Constraints:

    • <code>3 <= colors.length <= 10<sup>5</sup></code>

    • 0 &lt;= colors[i] &lt;= 1

    • 3 &lt;= k &lt;= colors.length

    • 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 Integer numberOfAlternatingGroups(IntArray colors, Integer k)

      • Methods inherited from class java.lang.Object

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