leetcode

0 class Solution {

1 static constexpr const int size = sizeof(int) * 8 - 1;

2

3 public:

4 int minOperations(const vector<int> &nums) {

5 int mini = INT_MAX, res = 0;

6 for (const int n : nums) {

7 if (n) mini = min(mini, __builtin_clz(n));

8 res += __builtin_popcount(n);

9 }

10 return max(0, res + size - mini);

11 }

12 };