有两种方案,递归的用到了动态规划。
//递归方案-动态规划
function fibonacci(num) {
if (num ===1||num ===2){
return 1;
}
if (num > 2){
return fibonacci(num-1)+fibonacci(num-2);
}
}
//非递归方案
function fib(num) {
var n1 =1,
n2 =1,
n =1;
for (var i = 3;i<num;i++){
n = n1+ n2;
n1 = n2;
n2 = n;
}
return n;
}