795. Number of Subarrays with Bounded Maximum

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

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

Example :
Input: 
A = [2, 1, 4, 3]
L = 2
R = 3
Output: 3
Explanation: There are three subarrays that meet the requirements: [2], [2, 1], [3].
Note:

L, R  and A[i] will be an integer in the range [0, 10^9].
The length of A will be in the range of [1, 50000].

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/number-of-subarrays-with-bounded-maximum
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

找到所有最大数小于等于R的子数组，再找到所有最大数小于等于L - 1的子数组。两者相减。

class Solution {
    public int numSubarrayBoundedMax(int[] A, int L, int R) {
        int lessL = numSubarrayBounded(A, L - 1);
        int lessR = numSubarrayBounded(A, R);
        return lessR - lessL;
    }

    public int numSubarrayBounded(int[]A, int L) {
        int count = 0;
        int total = 0;
        for (int i = 0; i < A.length; i++) {
            if (A[i] <= L) {
                count++;
            } else {
                count = 0;
            }
            total += count;
        }
        return total;
    }
}