Count Number of Maximum Bitwise-OR Subsets LeetCode solution in Python

1
class Solution:
2
    def countMaxOrSubsets(self, nums: List[int]) -> int:
3

4
        def dfs(i, val):
5
            if maxBit == val:
6
                return 1 << (len(nums) - i)
7
            if i == len(nums):
8
                return 0
9
            return dfs(i + 1, val | nums[i]) + dfs(i + 1, val)
10

11
        maxBit = 0
12
        for i in nums:
13
            maxBit |= i
14
        return dfs(0, 0)