[프로그래머스 Level 2] 피보나치 수

function solution(n) {
    const modular = 1234567;
    const table = new Array(n+1).fill(BigInt(0));
 
    table[1] = BigInt(1);
 
    for (let i = 2; i <= n; i++) {
        table[i] = (table[i-1].toString() % modular) + (table[i-2].toString() % modular);
    }
 
    return table[n].toString() % modular;
}

function solution(n) {
    const modular = BigInt(1234567);
    const table = new Array(n+1).fill(BigInt(0));
 
    table[1] = BigInt(1);
 
    for (let i = 2; i <= n; i++) {
        table[i] = (table[i-1] + table[i-2]) % modular;
    }
 
    return table[n];
}

function solution(n) {
    const modular = 1234567n;
    const table = new Array(n+1).fill(0n);
 
    function fibonacci(n) {
        if (n < 2) return table[n] = BigInt(n);
        if (table[n] > 0n) return table[n]; // ✅ 메모이제이션
 
        return table[n] = (fibonacci(n-1) + fibonacci(n-2)) % modular;
    }
 
    // n+1 재귀 호출
    return fibonacci(n);
}