leetcode

Solution to some Leetcode problems written in C++

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

0795.cpp (473B)

0 class Solution { 1 public: 2 int numSubarrayBoundedMax(const vector<int> &nums, int left, int right) const { 3 int res = 0, good = -1, last = -1; 4 5 for (int i = 0; i < size(nums); i++) { 6 if (nums[i] < left) 7 res += good - last; 8 else if (nums[i] > right) 9 good = last = i; 10 else { 11 res += i - last; 12 good = i; 13 } 14 } 15 16 return res; 17 } 18 };