将数字减为零的步骤数

问题

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

解决方案

 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;
    }
}

解决方案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;
    }

}

以上是将数字减为零的步骤数的详细内容。更多信息请关注PHP中文网其他相关文章！