| English | 简体中文 |
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.
a is a subset of an array
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 OR a OR ... OR a[a.length - 1] (0-indexed).
Input: nums = [3,1] Output: 2 Explanation: The maximum possible bitwise OR of a subset is 3. There are 2 subsets with a bitwise OR of 3: -  - [3,1]
Input: nums = [2,2,2] Output: 7 Explanation: All non-empty subsets of [2,2,2] have a bitwise OR of 2. There are 23 - 1 = 7 total subsets.
Input: nums = [3,2,1,5] Output: 6 Explanation: The maximum possible bitwise OR of a subset is 7. There are 6 subsets with a bitwise OR of 7: - [3,5] - [3,1,5] - [3,2,5] - [3,2,1,5] - [2,5] - [2,1,5]
1 <= nums.length <= 16
1 <= nums[i] <= 105