1342. Number of Steps to Reduce a Number to Zero - LeetCode Solution

Bit Manupilation

Python

Python Code:

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

        
        return count

Comments

Submit

0 Comments

More Questions

1594B - Special Numbers	1614A - Divan and a Store
2085. Count Common Words With One Occurrence	2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages	2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion	1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals	1035. Uncrossed Lines
328. Odd Even Linked List	1219. Path with Maximum Gold
1268. Search Suggestions System	841. Keys and Rooms
152. Maximum Product Subarray	337. House Robber III
869. Reordered Power of 2	1593C - Save More Mice
1217. Minimum Cost to Move Chips to The Same Position	347. Top K Frequent Elements
1503. Last Moment Before All Ants Fall Out of a Plank	430. Flatten a Multilevel Doubly Linked List
1290. Convert Binary Number in a Linked List to Integer	1525. Number of Good Ways to Split a String
72. Edit Distance	563. Binary Tree Tilt
1306. Jump Game III	236. Lowest Common Ancestor of a Binary Tree
790. Domino and Tromino Tiling	878. Nth Magical Number