鬼谷猜想算法实现:计算循环次数 - Java 代码示例
public class GhostValleyConjecture {\n public static int countIterations(int num) {\n int count = 0; // 计数器\n while (num != 1) {\n if (num % 2 == 0) {\n num = num / 2;\n } else {\n num = num * 3 + 1;\n } \n count++;\n }\n return count;\n }\n\n public static void main(String[] args) {\n int num = 10;\n int iterations = countIterations(num);\n System.out.println("循环次数:" + iterations);\n }\n}
原文地址: https://www.cveoy.top/t/topic/pHjB 著作权归作者所有。请勿转载和采集!