①非递归
var fib = function(n) {
if(n < 1)
return 0 ;
else if(n <=2 )
return 1;
let temp = 1;
let temp1 = 1;
let result;
for(let i = 3; i<= n;i++){
result = (temp+temp1) % (1e9 + 7);
temp = temp1;
temp1 = result;
}
return result;
};
②递归
时间太长。。。。。
var fib = function(n) {
if(n < 1)
return 0 ;
else if(n <=2 )
return 1;
return (fib(n-1) + fib(n-2))% (1e9 + 7);
}