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

1
class Solution {
2
  public int countMaxOrSubsets(int[] nums) {
3

4
    subsets(nums, 0, 0);
5
    return count;
6
  }
7

8
  int count = 0;
9
  int maxOR = 0;
10

11
  private void subsets(int[] arr, int vidx, int OR) {
12

13
    if (vidx == arr.length) {
14

15
      if (OR == maxOR) {
16
        count++;
17
      } else if (OR > maxOR) {
18
        count = 1;
19
        maxOR = OR;
20
      }
21

22
      return;
23
    }
24

25
    // include
26
    subsets(arr, vidx + 1, OR | arr[vidx]);
27

28
    // exclude
29
    subsets(arr, vidx + 1, OR);
30
  }
31
}