Number of Steps to Reduce a Number to Zero

Problem

https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/

Solution

 class Solution {
    public int numberOfSteps(int num) {
        int steps = 0;
        while (num > 0) {
            if (num % 2 == 0) {
                num /= 2;
                System.out.println(num);

            } else {
                num--;
            }
            steps++;
            System.out.println(steps);

        }
        return steps;
    }
}

Solution 02

class Solution {

    public int numberOfSteps(int num) {
        if (num == 0) {
            return 0;
        } else if (num % 2 == 0) {
            return (numberOfSteps(num / 2) + 1);
        } else if (num % 2 == 1) {
            return (numberOfSteps(num - 1) + 1);
        }
        return 0;
    }

}

The above is the detailed content of Number of Steps to Reduce a Number to Zero. For more information, please follow other related articles on the PHP Chinese website!