编辑代码

//递归
function recursiveFibonacci(n) {
    if (n <= 1) {
        return n;
    }
    return recursiveFibonacci(n - 1) + recursiveFibonacci(n - 2);
}

//递推
function iterativeFibonacci(n) {
    if (n <= 1) {
        return n;
    }
    let prev = 0;
    let current = 1;
    for (let i = 2; i <= n; i++) {
        const temp = current;
        current = prev + current;
        prev = temp;
    }
    return current;
}