Java撰寫斐波那契數列
@Test
public void test2() {
long d1 =System.currentTimeMillis();
int a=45;
//斐波那契數列
int fia = aaa(a);
long d2 =System.currentTimeMillis();
System.out.printf("斐波那契數列aaa方法第%d個是%d\t所用時間為%sms\n",a,fia,d2-d1);
long d3 =System.currentTimeMillis();
int fib = Fibonacci(a);
long d4 =System.currentTimeMillis();
System.out.printf("斐波那契數列Fibonacci方法第%d個是%d\t所用時間為%sms",a,fib,d4-d3);
}
public int aaa(int a) {
if(a==0){
return 0;
}if(a==1){
return 1;
}
return aaa(a-1)+aaa(a-2);
}
public int Fibonacci(int n) {
int[] fib= {0, 1};
if(n < 2) {
return fib[n];
}
int first = 0;
int second = 1;
int fibn = 0;
for(int i = 2; i <= n; i++) {
fibn = first + second;
first = second;
second = fibn;
}
return fibn;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/288292.html
標籤：其他