function fibonacci(n){
if(n<1) return 0;
if(n<=2) return 1;
return fibonacci(n-1)+fibonacci(n-2)
}
function Fibonacci(n)
{
let dp = [0,1]
for(let i=2;i<=n;i++){
dp[i] = dp[i-1]+dp[i-2]
}
return dp[n]
}
function fib(n) {
if (n < 2) return n;
let prev = 0, curr = 1;
for (let i = 0; i < n - 1; i++) {
let sum = prev + curr;
prev = curr;
curr = sum;
}
return curr;
}
//红宝书上的尾调用优化版,把递归改写为迭代循环的形式,因为递归写法存在加法不能进行尾调用优化
function fib(n){
return finImpl(0,1,n)
}
function finImpl(a,b,n){
if(n==0){
return a;
}
return finImpl(b,a+b,n-1)
}
//n为层数
function fn(n){
var str = ''
var count = 1
var space = ' ';
for(var i=n;i>0;i--){
for(var j=1;j<=i;j++){
str += fibonacci(j) + ' ';
}
for(var j=i-1;j>0;j--){
str += fibonacci(j) + ' ';
}
str += '\n' + space.repeat(count++)
}
console.log(str);
}
console.log(fn(6))