Number of Steps to Reduce a Number to Zero-C++

//Given an integer num, return the number of steps to reduce it to zero.

//In one step, if the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it.



class Solution {
public:
    int numberOfSteps(int num) {
        int steps=0;
        while(num){
            if(num%2 ==0) num /=2;
            else num -= 1;
            steps +=1;
        }
        return steps;
    }
};