ONE FOR LOOP!!!!
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(object):\n    def countAlternatingSubarrays(self, nums):\n        n=len(nums)\n        nums.append(nums[-1])\n        x=n\n        t=0\n        for i in range(1,n+1):\n            if(nums[i]==nums[i-1]):\n                x+=((t*(t+1))//2)\n                t=0\n            else:\n                t+=1\n        return x\n        \n```
['Python']