每天一道演算法--經典兔子繁殖迭代問題(斐波那契數列)
阿新 • • 發佈:2019-02-09
題目:古典問題:有一對兔子,從出生後第3個月起每個月都生一對兔子,小兔子長到第三個月後每個月又生一對兔子,假如兔子都不死,問每個月的兔子總數為多少?
1.程式分析: 兔子的規律為數列1,1,2,3,5,8,13,21….
由規律可知:
f(x) = f(x-1)+f(x-2)
符合斐波那契數列(斐波那契數列係數就由之前的兩數相加)
public class Rabbit {
private static long rabbit(int month){
long rabbitOne = 1L;
long rabbitTwo = 1L;
long rabbit;
for(int i=3;i<=month;i++){
rabbit = rabbitTwo;
rabbitTwo = rabbitOne + rabbitTwo;
rabbitOne = rabbit;
}
return rabbitTwo;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int i = in.nextInt();
System.out.println(i+"個月後兔子總數:"+rabbit(i));
main(args);
}
}