大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项
0,1,1,2,3,5。。。F(n) = F(n-1)+F(n-2) //递归调用时,时间空间耗费过大
import java.util.Vector;
public class Solution {
public int Fibonacci(int n) {
if(0 == n){
return 0;
}else if(1 == n){
return 1;
}else{
Vector v = new Vector();
v.add(new Integer(0));
v.add(new Integer(1));
Integer one = new Integer(0);
int first;
int second;
int sum;
for(int i=2; i<=n; i++){
first = ((Integer)v.get(i-1)).intValue();
second = ((Integer)v.get(i-2)).intValue();
sum = first + second;
one = Integer.valueOf(sum);
v.add(one);
}
return ((Integer)v.get(n)).intValue();
}
}
}