-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountStepToZero.java
More file actions
34 lines (28 loc) · 952 Bytes
/
CountStepToZero.java
File metadata and controls
34 lines (28 loc) · 952 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
package Recursion;
public class CountStepToZero {
static int count = 0;
public static int numberOfSteps(int num) {
if(num==0)
return count;
count++;
if(num%2==0){
return numberOfSteps(num/2);
}
return numberOfSteps(num-1);
}
public static void main(String[] args) {
System.out.println(numberOfSteps(14));
}
}
// 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.