[Leetcode] Number of subarrays with bounded Maximum count of sub-arrays with bounds maximum

We is given an array A of positive integers, and both positive integers L and R ( L <= R ).

Return the number of (contiguous, non-empty) subarrays such, the value of the maximum array element in that Subarray I s at least and at the most L R .

Example:input:a = [2, 1, 4, 3]l = 2R = 3output:3explanation:there is three subarrays that meet the requirements: [2], [2, 1], [3].

Note:

• L, R and would be a integer in the A[i] range [0, 10^9] .
• The length of'll is in the A range of [1, 50000] .

S

[Leetcode] Number of subarrays with bounded Maximum count of sub-arrays with bounds maximum