本题主要考察递归方法
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
System.out.println(countStep(num));
}
public static Integer countStep(Integer num) {
if (num == 1) {
return 0;
}
if (num % 2 == 0) {
return countStep(num / 2) + 1;
} else {
return countStep((3 * num + 1) / 2) + 1;
}
}
}