题目描述
大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。
n<=39
我的解法:
使用递归实现。复杂度很高
public class Solution {
public int Fibonacci(int n) {
int a[] = new int[200];
a[0] = 0;
a[1] = 1;
for (int i = 2; i < n + 1; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[n];
/*if(n <= 1)
return n;
return Fibonacci(n - 1) + Fibonacci(n - 2);*/
}
}
优化内存解法:
不调用数组而用三个变量来实现
public class Solution {
public int Fibonacci(int n) {
if(n == 0){
return 0;
}else if(n == 1){
return 1;
}
int sum = 0;
int two = 0;
int one = 1;
for(int i=2;i<=n;i++){
sum = two + one;
two = one;
one = sum;
}
return sum;
}
}
持续优化法:
public class Solution {
public int Fibonacci(int n) {
if(n == 0){
return 0;
}else if(n == 1){
return 1;
}
int sum = 1;
int one = 0;
for(int i=2;i<=n;i++){
sum = sum + one;
one = sum - one;
}
return sum;
}
}
3. 复杂度