Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1342 - Number of Steps to Reduce a Number to Zero\.

    Easy

    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.

    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:

    • <code>0 <= num <= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Integer numberOfSteps(Integer num)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait