Longest Subsequence With Maximum Bitwise AND
暂无测试数据。
You are given an integer array nums of size n.
Consider a non-empty subsequence from nums that has the maximum possible bitwise AND.
In other words, let k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should be considered.
Return the length of the longest such subsequence.
The bitwise AND of an array is the bitwise AND of all the numbers in it.
A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements (source: wiki)
Example 1:
Input: nums = [1,2,3,3,2,2]
Output: 2
Explanation:
The maximum possible bitwise AND of a subarray is 3.
The longest subarray with that value is [3,3], so we return 2.
Example 2:
Input: nums = [1,2,3,4]
Output: 1
Explanation:
The maximum possible bitwise AND of a subarray is 4.
The longest subarray with that value is [4], so we return 1.
Constraints:
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6
Source
A possible follow up for Leetcode 2419. Longest Subarray With Maximum Bitwise AND
信息
- ID
- 1004
- 难度
- (无)
- 分类
- (无)
- 标签
- (无)
- 递交数
- 0
- 已通过
- 0
- 通过率
- ?
- 上传者