Number of Steps to Reduce a Number to Zero LeetCode solution in C++

1
class Solution {
2
 public:
3
  int numberOfSteps(int num) {
4
    int count = 0;
5
    while (num > 0) {
6
      if (num % 2 == 0) {
7
        num = num / 2;
8
        count++;
9
      } else {
10
        if (num > 1) {
11
          num -= 1;
12
          count++;
13
        } else {
14
          count++;
15
          break;
16
        }
17
      }
18
    }
19
    return count;
20
  }
21
};