Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it.
 
Example 1:
Input: num = 14
Output: 6
Explanation: 
Step 1) 14 is even; divide by 2 and obtain 7. 
Step 2) 7 is odd; subtract 1 and obtain 6.
Step 3) 6 is even; divide by 2 and obtain 3. 
Step 4) 3 is odd; subtract 1 and obtain 2. 
Step 5) 2 is even; divide by 2 and obtain 1. 
Step 6) 1 is odd; subtract 1 and obtain 0.

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

Example 3:
Input: num = 123
Output: 12

 
Constraints:

0 <= num <= 10^6

Difficulty: introductory

Starter code:

class Solution:
    def numberOfSteps (self, num: int) -> int:
        

Solutions:
class Solution:
    def numberOfSteps (self, num: int) -> int:
        steps = 0
        while num > 0:
            if num % 2 == 0:
                num /= 2
            else:
                num -= 1
            steps += 1
        return steps


class Solution:
    def numberOfSteps (self, num: int) -> int:
        bnum = bin(num)
        return len(bnum) + bnum.count('1') - 3

class Solution:
    def numberOfSteps (self, num: int) -> int:
        return len(bin(num)) + bin(num).count('1') - 3

class Solution:
    def numberOfSteps (self, num: int) -> int:
        
        steps = 0
        while(num>0):
            # print(num)
            if num%2 == 0:
                num = num/2
                steps+=1
            else:
                num = num-1
                steps+=1
        return steps

class Solution:
    def numberOfSteps (self, num: int) -> int:
        count=0
        while num>0:
            if num&1:
                count+=1
            num=num>>1
            count+=1
            
        return count-1 if count > 0 else count

class Solution:
    def numberOfSteps (self, num: int) -> int:
        count = 0
        
        while num!=0:
            if num%2 == 0:
                num /= 2
                count += 1
            else:
                num -= 1
                count += 1
        return count

class Solution:
    def numberOfSteps (self, num: int) -> int:
        count = 0
        
        while num!=0:
            if num%2 == 0:
                num = num/2
            else:
                num -= 1
            count += 1
        return count

class Solution:
    def numberOfSteps (self, num):
        steps = 0 # We need to keep track of how many steps this takes.
        while num > 0: # Remember, we're taking steps until num is 0.
            if num % 2 == 0: # Modulus operator tells us num is *even*.
                num = num // 2 # So we divide num by 2.
            else: # Otherwise, num must be *odd*.
                num = num - 1 # So we subtract 1 from num.
            steps = steps + 1 # We *always* increment steps by 1.
        return steps # And at the end, the answer is in steps so we return it.


class Solution:
    def numberOfSteps (self, num: int) -> int:
        
        steps = 0
        
        while num > 0:
            if num%2 == 0:
                num = num//2
                steps += 1
            else:
                num -=1
                steps +=1
        return steps


class Solution:
    def numberOfSteps (self, num: int) -> int:
        if num==0:return 0
        ans=0
        while num!=0:
            if num&1==0:
                num=num>>1
                ans+=1
            else:
                if num==1:
                    return ans+1
                num=num>>1
                ans+=2
        return ans


class Solution:
    def numberOfSteps (self, num: int) -> int:
        cnt = 0
        while num:
            if num & 1: num -= 1
            else: num >>= 1
            cnt += 1
        return cnt