数据结构-递归

    xiaoxiao2021-03-25  156

    定义一个整数N,不用本地变量和循环,输入N,依次判断2N,4N,8N…,一旦大于5000,则倒序输出小于5000的那些数(…,8N,4N,2N,N);

    public static void main(String... strings) { div2(999, mult2(999)); } public static int mult2(int num) { System.out.println(num); if (num < 5000) { return mult2(num * 2); } else { return num; } } public static void div2(int num, int cellNum) { System.out.println(cellNum); if (cellNum > num) { div2(num, cellNum / 2); } }

    结果: 999 1998 3996 7992 7992 3996 1998 999

    转载请注明原文地址: https://ju.6miu.com/read-11848.html

    最新回复(0)