1function fibNaive(n) {
2 if (n <= 1) return n;
3 return fibNaive(n - 1) + fibNaive(n - 2);
4}
5const memo = new Map();
6function fibMemo(n) {
7 if (n <= 1) return n;
8 if (memo.has(n)) return memo.get(n);
9 const res = fibMemo(n - 1) + fibMemo(n - 2);
10 memo.set(n, res);
11 return res;
12}