Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2401 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2401 # by problem number
lcpy gen -s longest_nice_subarray # by problem name
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.
Input: nums = [1,3,8,48,10]
Output: 3
Explanation: The longest nice subarray is [3,8,48]. This subarray satisfies the conditions:
- 3 AND 8 = 0.
- 3 AND 48 = 0.
- 8 AND 48 = 0.
It can be proven that no longer nice subarray can be obtained, so we return 3.
Input: nums = [3,1,5,11,13]
Output: 1
Explanation: The length of the longest nice subarray is 1. Any subarray of length 1 can be chosen.
class Solution:
# Time: O(n)
# Space: O(1)
def longest_nice_subarray(self, nums: list[int]) -> int:
best = 0
window_or = 0
left = 0
for right, num in enumerate(nums):
while window_or & num:
window_or ^= nums[left]
left += 1
window_or |= num
best = max(best, right - left + 1)
return best
| Time | Space |
|---|---|
| O(n) | O(1) |