leetcode_problem_solving/memoizedFibonacci.js at main · MdNazmulHaqueA/leetcode_problem_solving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
function fibMemo(index, cache) {
  cache = cache || [];
  if (cache[index]) return cache[index]; //base case.
  else {
    if (index < 3) return 1;
    else {
      cache[index] = fibMemo(index - 1, cache) + fibMemo(index - 2, cache);
    }
  }

  return cache[index];
}

fibMemo(500); //first time we call this function we don't have to pass the cache into because no fibonacci number has been calculated yet. We need to define the cache inside our function.