Package g2401_2500.s2444_count_subarrays_with_fixed_bounds

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2444 - Count Subarrays With Fixed Bounds\.

    Hard

    You are given an integer array nums and two integers minK and maxK.

    A fixed-bound subarray of nums is a subarray that satisfies the following conditions:

    • The minimum value in the subarray is equal to minK.

    • The maximum value in the subarray is equal to maxK.

    Return the number of fixed-bound subarrays.

    A subarray is a contiguous part of an array.

    Example 1:

    Input: nums = 1,3,5,2,7,5, minK = 1, maxK = 5

    Output: 2

    Explanation: The fixed-bound subarrays are 1,3,5 and 1,3,5,2.

    Example 2:

    Input: nums = 1,1,1,1, minK = 1, maxK = 1

    Output: 10

    Explanation: Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.

    Constraints:

    • <code>2 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi, minK, maxK <= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long countSubarrays(IntArray nums, Integer minK, Integer maxK)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait