2044. Count Number of Maximum Bitwise-OR Subsets
## 思路
最大值会是整个nums做or
因为nums最多只有16个数字, 直接暴力搜所有组合
时间复杂度 O(N 2^N)
比解答的DP慢好多QQ
## Code
```python
class Solution:
def countMaxOrSubsets(self, nums: List[int]) -> int:
n = len(nums)
max_or = 0
for num in nums:
max_or |= num
res = 0
for i in range(1 << n):
curr = 0
for j in range(n):
if i & (1 << j):
curr |= nums[j]
if curr == max_or:
res += 1
return res
```