137. Number of Subarrays with Bounded Maximum

Given an integer array nums and two integers left and right, return the number of contiguous non-empty subarrays whose maximum element is in the range [left, right]. Input: '[nums], left, right'.

Input: '[nums], left, right'.

Output: Integer — count of subarrays.

Examples

Input: [2,1,4,3], 2, 3
Output: 3
Explanation: Subarrays [2],[2,1],[3].

Input: [2,9,2,5,6], 2, 8
Output: 7
Explanation: Seven valid subarrays.

Constraints

• 1<=n<=10^5
• 0<=left<=right<=10^9
• 0<=nums[i]<=10^9

Asked by