Number of Steps to Reduce a Number to Zero
Easy
Topics
Given an integer n, return the number of steps to reduce it to zero. In one step, if the number is even divide it by two, otherwise subtract one.
Example 1
Input: n = 14 Output: 6
Example 2
Input: n = 8 Output: 4
Example 3
Input: n = 0 Output: 0
Constraints
- 0 <= n <= 10^6
Run ⌘' · Submit ⌘⏎