Count Number of Maximum Bitwise-OR Subsets
Given an integer array nums, find the maximum possible bitwise OR of a subset of nums and return the number of different non-empty subsets with the maximum bitwise OR.
An array a is a subset of an array b if a can be obtained from b by deleting some (possibly zero) elements of b. Two subsets are considered different if the indices of the elements chosen are different.
The bitwise OR of an array a is equal to a[0] OR a[1] OR ... OR a[a.length - 1] (0-indexed).
Example 1
Input
nums = [3,1]Output
2The maximum possible bitwise OR of a subset is 3, and the two subsets that achieve it are [3] and [3, 1].
Example 2
Input
nums = [2,2,2]Output
7All non-empty subsets of [2, 2, 2] have a bitwise OR of 2, so there are 2^3 - 1 = 7 subsets.
Constraints
- 1 <= nums.length <= 16
- 1 <= nums[i] <= 10^5