LeetCode 795. Number of Subarrays with Bounded Maximum C++

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].

Approach

1. 题目大意就是最大的元素不小于L，也不大于R的连续子数组有多少个，思路比较明显，我们可以先找不大于R的区间有多少个， 然后再找小于L的区间有多少个，然后两个相减即是答案。

Code

class Solution {
public:
    int numSubarrayBoundedMax(vector<int>& A, int L, int R) {
        return count(A, R) - count(A, L - 1);
    }
    int count(vector<int>&A,int R) {
        int ret = 0, cnt = 0;
        for (auto &a : A) {
            if (a <= R)ret++;
            else ret = 0;
            cnt += ret;
        }
        return cnt;
    }
};