leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

3101.cpp (304B)

0 class Solution { 1 public: 2 long long countAlternatingSubarrays(const vector<int> &nums) const { 3 long long res = 1; 4 5 for (int i = 1, cnt = 1; i < size(nums); i++) { 6 cnt = nums[i] == nums[i - 1] ? 1 : cnt + 1; 7 res += cnt; 8 } 9 10 return res; 11 } 12 };