C++ | Easy
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=1,res=nums.size(),n=nums.size();\n        for(long long i=0;i<n-1;i++){\n            if(nums[i]!=nums[i+1])count++;\n            if(nums[i]!=nums[i+1]&&i==n-2){\n                res=res-count+count*(count+1)/2;\n                count=1;\n            }\n            if(nums[i]==nums[i+1]){\n                res=res-count+count*(count+1)/2;\n                count=1;\n            }\n        }\n        return res;\n    }\n};\n```
['C++']