Largest Combination With Bitwise AND Greater Than Zero LeetCode solution in C++

1
class Solution {
2
 public:
3
  int largestCombination(vector<int> &candidates) {
4
    vector<int> bits(32);
5
    for (int i = 0; i < candidates.size(); i++) {
6
      int temp = 31;
7
      while (candidates[i] > 0) {
8
        bits[temp] += candidates[i] % 2;
9
        candidates[i] = candidates[i] / 2;
10
        temp--;
11
      }
12
    }
13
    int ans = 0;
14
    for (int i = 0; i < 32; i++) {
15
      // cout<<bits[i]<<" ";
16
      ans = max(ans, bits[i]);
17
    }
18
    return ans;
19
  }
20
};