Java演算法–遞推演算法 求解兔子產子問題或斐波那契數列問題

代碼：

 

package com.xu.main;import java.util.Scanner;public class P7_1 {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("請先輸入時間:");Scanner input = new Scanner(System.in);int n = input.nextInt();int num = fibonacci(n);System.out.println("經過"+ n + "月的時間，功能繁殖成"+ num + "對兔子!");}}

 

運行結果