longest-nice-subarray

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>nums</code> consisting of positive integers.

We call a subarray of <code>nums</code> nice if the bitwise AND of every pair of elements that are in different positions in the subarray is equal to <code>0</code>.

Return the length of the longest nice subarray.

A subarray is a contiguous part of an array.

Note that subarrays of length <code>1</code> are always considered nice.

&nbsp;
Example 1:

<pre>
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.</pre>

Example 2:

<pre>
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.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>

longestNiceSubarray

Longest Nice Subarray

Longest Substring Without Repeating Characters

longest-substring-without-repeating-characters

无重复字符的最长子串

Bitwise AND of Numbers Range

bitwise-and-of-numbers-range

数字范围按位与

Bitwise ORs of Subarrays

bitwise-ors-of-subarrays

子数组按位或操作

Fruit Into Baskets

fruit-into-baskets

水果成篮

Max Consecutive Ones III

max-consecutive-ones-iii

最大连续1的个数 III

Get Equal Substrings Within Budget

get-equal-substrings-within-budget

尽可能使字符串相等

Frequency of the Most Frequent Element

frequency-of-the-most-frequent-element

最高频元素的频数

Longest Substring Of All Vowels in Order

longest-substring-of-all-vowels-in-order

所有元音按顺序排布的最长子字符串

Maximize the Confusion of an Exam

maximize-the-confusion-of-an-exam

考试的最大困扰度

Maximum Sum of Distinct Subarrays With Length K

maximum-sum-of-distinct-subarrays-with-length-k

长度为 K 子数组中的最大和

Bit Manipulation

Array

Sliding Window

给你一个由 正 整数组成的数组 <code>nums</code> 。

如果&nbsp;<code>nums</code> 的子数组中位于 不同 位置的每对元素按位 与（AND）运算的结果等于 <code>0</code> ，则称该子数组为 优雅 子数组。

返回 最长 的优雅子数组的长度。

子数组 是数组中的一个 连续 部分。

注意：长度为 <code>1</code> 的子数组始终视作优雅子数组。

&nbsp;

示例 1：

<pre>输入：nums = [1,3,8,48,10]
输出：3
解释：最长的优雅子数组是 [3,8,48] 。子数组满足题目条件：
- 3 AND 8 = 0
- 3 AND 48 = 0
- 8 AND 48 = 0
可以证明不存在更长的优雅子数组，所以返回 3 。</pre>

示例 2：

<pre>输入：nums = [3,1,5,11,13]
输出：1
解释：最长的优雅子数组长度为 1 ，任何长度为 1 的子数组都满足题目条件。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>