Beats 100% user || very easy to understand
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    long long countAlternatingSubarrays(vector<int>& nums) {\n        long long count=0;\n        long long left =0;\n        for(int right=0;right<nums.size();right++){\n\n            if(right>0 && nums[right]==nums[right-1]){\n               left=right;\n            }\n            count+=right-left+1;\n        }\n        return count;\n    }\n};\n```
['C++']