Fibonacci数列形式:F(0) = 0,F(1)=1,F(n)=F(n-1)+F(n-2) if n>1。
求解该数列的第n项有三种方法,其中前两种方法很好理解。主要解释下第三种方法的思路:
Fibonacci是二阶递推数列,所以存在一个2*2的矩阵A,使得:
(Fn,Fn−1)=(Fn−1,Fn−2)∗A=...=(F1,F0)∗An−1
求得:
A=[1110]
那么求数列的第n项就是等于求矩阵A的第n-1次幂,计算的速度快,时间复杂度为O(logn)。
package suda.alex.chapter2;
import java.util.*;
import Jama.*;
public class Fibonacci {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner = new Scanner(System.in);
System.out.println("please input a number: ");
int n = scanner.nextInt();
// System.out.println("result:" + fibonacci1(n));
// System.out.println("result:" + fibonacci2(n));
System.out.println("result:" + fibonacci3(n));
}
public static int fibonacci1(int n){
if(n == 0){
return 0;
}
else if(n == 1){
return 1;
}
else{
return fibonacci1(n-1) + fibonacci1(n-2);
}
}
public static int fibonacci2(int n){
return (int) ((Math.sqrt(5)/5)*Math.pow((1+Math.sqrt(5))/2, n) - (Math.sqrt(5)/5)*Math.pow((1-Math.sqrt(5))/2, n));
}
public static int fibonacci3(int n){
if(n == 0)
return 0;
--n;
double[] temp = {1.,0.,0.,1.};
Matrix a = new Matrix(temp,2);
double[] prod = {1.0,1.0,1.0,0.0};
Matrix b = new Matrix(prod,2);
while(n!=0){
if((n&1)!= 0){
a = a.times(b);
}
b = b.times(b);
n >>= 1;
}
return (int)a.get(0, 0);
//System.out.println(a.get(2, 1));
}
}