leetcode

0 class Solution {

1 public:

2 int largestCombination(const vector<int> &candidates) {

3 int res = 0, maxi = *max_element(begin(candidates), end(candidates));

4 for (int mask = 1, cnt = 0; mask <= maxi; mask <<= 1, cnt = 0) {

5 for (int n : candidates)

6 cnt += (n & mask) > 0;

7 res = max(res, cnt);

8 }

9 return res;

10 }

11 };