leetcode

Solution to some Leetcode problems written in C++

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

1248.cpp (430B)

0 class Solution { 1 int atMost(const vector<int> &nums, int k) { 2 int res = 0, j = 0; 3 for (int i = 0; i < nums.size(); i++) { 4 if (nums[i] % 2) k--; 5 while (k < 0) 6 if (nums[j++] % 2) k++; 7 res += i - j + 1; 8 } 9 return res; 10 } 11 12 public: 13 int numberOfSubarrays(const vector<int> &nums, int k) { return atMost(nums, k) - atMost(nums, k - 1); } 14 };