Adjacent Increasing Subarrays Detection II
Given an array nums of n integers, your task is to find the maximum value of k for which there exist two adjacent subarrays of length k each, such that both subarrays are strictly increasing.
Specifically, check if there are two subarrays of length k starting at indices a and b (a < b), where:
- Both subarrays
nums[a..a + k - 1]andnums[b..b + k - 1]are strictly increasing. - The subarrays must be adjacent, meaning
b = a + k.
Return the maximum possible value of k.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1
Input
nums = [2,5,7,8,9,2,3,4,3,1]Output
3The adjacent subarrays
[7, 8, 9] and [2, 3, 4] are both strictly increasing, and 3 is the maximum possible value of k.Example 2
Input
nums = [1,2,3,4,4,4,4,5,6,7]Output
2The adjacent subarrays
[1, 2] and [3, 4] are both strictly increasing, and 2 is the maximum possible value of k.Constraints
- 2 <= nums.length <= 2 * 10^5
- -10^9 <= nums[i] <= 10^9