mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
38 lines
1.4 KiB
HTML
38 lines
1.4 KiB
HTML
<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
|
|
|
|
<p>We call a subarray of <code>nums</code> <strong>nice</strong> if the bitwise <strong>AND</strong> of every pair of elements that are in <strong>different</strong> positions in the subarray is equal to <code>0</code>.</p>
|
|
|
|
<p>Return <em>the length of the <strong>longest</strong> nice subarray</em>.</p>
|
|
|
|
<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
|
|
|
|
<p><strong>Note</strong> that subarrays of length <code>1</code> are always considered nice.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,3,8,48,10]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> 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.</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,1,5,11,13]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> The length of the longest nice subarray is 1. Any subarray of length 1 can be chosen.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|