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.

&nbsp;
Example 1:

Input: num = 14
Output: 6
Explanation:&nbsp;
Step 1) 14 is even; divide by 2 and obtain 7.&nbsp;
Step 2) 7 is odd; subtract 1 and obtain 6.
Step 3) 6 is even; divide by 2 and obtain 3.&nbsp;
Step 4) 3 is odd; subtract 1 and obtain 2.&nbsp;
Step 5) 2 is even; divide by 2 and obtain 1.&nbsp;
Step 6) 1 is odd; subtract 1 and obtain 0.


Example 2:

Input: num = 8
Output: 4
Explanation:&nbsp;
Step 1) 8 is even; divide by 2 and obtain 4.&nbsp;
Step 2) 4 is even; divide by 2 and obtain 2.&nbsp;
Step 3) 2 is even; divide by 2 and obtain 1.&nbsp;
Step 4) 1 is odd; subtract 1 and obtain 0.


Example 3:

Input: num = 123
Output: 12


&nbsp;
Constraints:


	0 &lt;= num &lt;= 106


class Solution:
    def numberOfSteps(self, num: int) -> int:
        count=0
        while num:
            if num%2:
                num=num-1
            else:
                num=num//2
            count+=1
        return count
class Solution {
    public int numberOfSteps(int num) {
        return helper(num,0);
    }
    public int helper(int n,int c){
        if(n==0) return c;
        if(n%2==0){              //check for even no.
            return helper(n/2,c+1);
        }
        
        return helper(n-1,c+1);
    }
}
class Solution {
public:
    int numberOfSteps(int num) {
        int count = 0;
        while (num > 0)
        {
            if (num % 2==0)
            {
                num = num/2;
                count++;
            }
            else
            {
                if(num > 1)
                {
                    num -= 1;
                    count++;
                }
                else
                {
                    count++;
                    break;
                }
            }
        }
        return count;
    }
};
var numberOfSteps = function(num) {
    let steps = 0
    while (num > 0) {
        if (num % 2 === 0) {
            num = num/2
            steps++
        }

        if (num % 2 === 1) {
            num--
            steps++
        }
    }

    return steps

};
Number of Steps to Reduce a Number to Zero