递推算法

package com.xj.www.algo;
import java.util.Scanner;
/**
 * 递推算法
 *
 * @author xiongjing
 *
 */
public class RecursionTest {
      // 算法具体实现
      public static int fibonacci(int n) {
            int t1, t2;
            if (n == 1 || n == 2) {
                  return 1;
            } else {
                  t1 = fibonacci(n - 1);
                  t2 = fibonacci(n - 2);
                  return t1 + t2;
            }
      }
      // 程序主入口
      public static void main(String[] args) {
            System.out.println("递推算法求解兔子产仔问题！");
            System.out.println("请先输入时间：");
            @SuppressWarnings("resource")
            Scanner sc = new Scanner(System.in);
            int n = sc.nextInt();
            int num = fibonacci(n);
            System.out.println("经过" + n + "个月的时间，功能繁殖成" + num + "对兔子！");
      }
}