Java经典递归算法

1.斐波那契数列 package com.luna.base; public class BirthRabbit { public static void main(String[] args) { int i = 1; for (i = 1; i <= 20; i++) { System.out.println("兔子第" + i + "个月的总数为:" + f(i)); }

>>阅读原文<<