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;
}
}
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中文網其他相關文章！
