This approach uses a sliding window technique with two pointers to efficiently count the subarrays. As we iterate through the array, we maintain a range that tracks the valid subarrays containing both minK and maxK. When a valid subarray is found, we slide the window to find other subarrays that meet the criteria.
Time Complexity: O(n), where n is the length of nums, as we iterate through the array once.
Space Complexity: O(1), as we are using a fixed amount of space.
1function countFixedBoundSubarrays(nums, minK, maxK) {
2 let left = -1, minPos = -1, maxPos = -1;
3 let count = 0;
4 for (let right = 0; right < nums.length; right++) {
5 if (nums[right] < minK || nums[right] > maxK)
6 left = right;
7 if (nums[right] === minK)
8 minPos = right;
9 if (nums[right] === maxK)
10 maxPos = right;
11 if (minPos > left && maxPos > left) {
12 count += Math.min(minPos, maxPos) - left;
13 }
14 }
15 return count;
16}
17
18// Example usage:
19console.log(countFixedBoundSubarrays([1, 3, 5, 2, 7, 5], 1, 5));This JavaScript function uses a two-pointer approach to identify and count subarrays that have minK and maxK as the fixed bounds. It handles the adjustment of potential subarray start indices based on boundary breaches dynamically.
This approach uses a brute force method to count fixed-bound subarrays by examining all possible subarrays in the provided array. For each subarray, check if the minimum and maximum elements match minK and maxK respectively.
Time Complexity: O(n2) due to the nested loops for subarray examination.
Space Complexity: O(1) as it uses a fixed number of variables.
1def count_fixed_bound_subarrays(nums, minK, maxK):
2 count = 0
3 for i in range(len(nums)):
4 min_val, max_val = float('inf'), float('-inf')
5 for j in range(i, len(nums)):
6 min_val = min(min_val, nums[j])
7 max_val = max(max_val, nums[j])
8 if min_val == minK and max_val == maxK:
9 count += 1
10 return count
11
12# Example usage:
13print(count_fixed_bound_subarrays([1, 3, 5, 2, 7, 5], 1, 5))In this exploratory Python solution, we go through each starting index in the array and check subsequences to identify those whose minimum and maximum values match the constraints of minK and maxK.