Minimum Numbers of Function Calls to Make Target Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minOperations(vector<int> &nums) {
4
    int ans = 0;
5
    while (true) {
6
      bool largerThan1 = false;
7
      bool allzero = true;
8
      for (auto &n : nums) {
9
        if (n == 0) continue;
10
        allzero = false;
11
        if (n > 1) largerThan1 = true;
12
        ans += n % 2;
13
        n /= 2;
14
      }
15
      ans += largerThan1; // we should do division if some element is larger
16
                          // than 1.
17
      if (allzero) break;
18
    }
19
    return ans;
20
  }
21
};