Coding-Problems/LeetCode/Solutions/LC0795.cpp at master · Mohammed-Shoaib/Coding-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
/*
Problem Statement: https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/
Time: O(n)
Space: O(1)
Author: Mohammed Shoaib, github.com/Mohammed-Shoaib
*/

class Solution {
public:
	int numSubarrayBoundedMax(vector<int>& nums, int left, int right) {
		int cnt = 0, n = nums.size();

		for (int i = 0, l = -1, r = -1; i < n; i++) {
			if (nums[i] > right)
				l = i;
			if (nums[i] >= left)
				r = i;
			cnt += r - l;
		}

		return cnt;
	}
};