colors.

Initialize ans to 0.

For each index i from 0 to n-1:

Let a = colors[i]
Let b = colors[(i+1)%n]
Let c = colors[(i+2)%n]
If b is different from both a and c, increment ans.

Return ans.

Code

[{"language":"C++","code":"class Solution {\npublic:\n   int alternatingSubarrayGroups(vector<int>& colors) {\n      int n = colors.size(), ans = 0;\n      for (int i = 0; i < n; ++i) {\n        int a = colors[i];\n        int b = colors[(i+1)%n];\n        int c = colors[(i+2)%n];\n        if (b != a && b != c) ans++;\n      }\n      return ans;\n   }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span>&

Related Tags