题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
function Fibonacci(n)
{
if(n == 1){
return 1
}
if(n == 2){
return 1
}
var res = [1,2]
if(n > 2){
var i = 2;
while(i <= n){
res.push(res[i-1]+res[i-2])
i++
}
return res[n-2]
}
}
module.exports = {
Fibonacci : Fibonacci
};