Longest Balanced Subarray II
You are given an integer array nums.
A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers.
Return the length of the longest balanced subarray.
Example 1
Input
nums = [2,5,4,3]Output
4The longest balanced subarray is
[2, 5, 4, 3], which has 2 distinct even numbers [2, 4] and 2 distinct odd numbers [5, 3].Example 2
Input
nums = [3,2,2,5,4]Output
5The longest balanced subarray is
[3, 2, 2, 5, 4], which has 2 distinct even numbers [2, 4] and 2 distinct odd numbers [3, 5].Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^5