n<=39
斐波那契数列:斐波那契数列指的是这样一个数列 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368........
java代码:
public class Solution {
public int Fibonacci(int n) {
if(n<0){
return 0;
}
else if (n==1) {
return 1;
}
int result=0;
int temp =0;
int temp1=1;
for(int i=2;i<=n;i++){
result=temp+temp1;
temp=temp1;
temp1=result;
}
return result;
}
}
python代码:
# -*- coding:utf-8 -*-
class Solution:
def Fibonacci(self, n):
if n<=0:
return 0
if n==1:
return 1
a=0
b=1
for i in range(2,n+1):
result=a+b
a=b
b=result
return result