Longest Nice Subarray
You are given an array nums consisting of positive integers.
We call a subarray of nums nice if the bitwise AND of every pair of elements that are in different positions in the subarray is equal to 0.
Return the length of the longest nice subarray.
A subarray is a contiguous part of an array.
Note that subarrays of length 1 are always considered nice.
Example 1
Input
nums = [1,3,8,48,10]Output
3The longest nice subarray is [3, 8, 48], whose pairwise bitwise AND values are all 0, and no longer nice subarray can be obtained.
Example 2
Input
nums = [3,1,5,11,13]Output
1The length of the longest nice subarray is 1, and any subarray of length 1 can be chosen.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^9