大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。n<=39
解题思路:1.递归
public class Solution {
public int Fibonacci(int n) {
if(n<=0)return 0;
if(n==1)return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
}
}
2.依次类推,时间复杂度为O(n)
public class Solution {
public int Fibonacci(int n) {
if(n==0)return 0;
if(n==1)return 1;
int One=1;
int Two=0;
int N=0;
for(int i=2;i<=n;i++){
N=One+Two;
Two=One;
One=N;
}
return N;
}
}