Basic algorithm idea----recursion

Import Java.util.scanner;public class Ditui {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) {//TODO auto-generated method StubSystem.out.println ("The ground-pushing algorithm solves the problem of rabbit litter!") "); System.out.print ("Please enter the time First:"); Scanner input = new Scanner (system.in); int n = input.nextint (); int num = Fibonacci (n); System.out.println ("After" +n+ "months of time, in total can breed into" +num+ "to the Rabbit");}}

　　

Basic algorithm idea----recursion