Package g0701_0800.s0795_number_of_subarrays_with_bounded_maximum

Class Solution

  • public class Solution
extends Object
    795 - Number of Subarrays with Bounded Maximum\. Medium Given an integer array `nums` and two integers `left` and `right`, return _the number of contiguous non-empty **subarrays** such that the value of the maximum array element in that subarray is in the range_ `[left, right]`. The test cases are generated so that the answer will fit in a **32-bit** integer. **Example 1:** **Input:** nums = [2,1,4,3], left = 2, right = 3 **Output:** 3 **Explanation:** There are three subarrays that meet the requirements: [2], [2, 1], [3]. **Example 2:** **Input:** nums = [2,9,2,5,6], left = 2, right = 8 **Output:** 7 **Constraints:** * 1 <= nums.length <= 105 * 0 <= nums[i] <= 109 * 0 <= left <= right <= 109

    • Constructor Detail

      • Solution

        public Solution()

    • Method Detail

      • numSubarrayBoundedMax

        public int numSubarrayBoundedMax​(int[] nums,
                                 int left,
                                 int right)