refactor: Update fibonacci with dp solution

Author: brianr482

recursion/fibonacci-with-dp.js

@@ -9,19 +9,18 @@
  * @return {number}
  */
 function fibonacciDp(n) {
-  if (n === 0) {
-    return 0;
+  const dp = [0, 1];
+  if (n < 2) {
+    return dp[n + 1];
   }
 
-  if (n == 1) {
-    return 1;
+  if (n === 1) {
+    return 1
   }
-
-  dp = [0, 1];
-  let total = 0;
-  for (let i = 2; i < n; i++) {
-    total += dp[i - 1] + dp[i - 2];
-    dp.push(total);
+  
+  for (let i = 2; i <= n; i++) {
+    dp[i] = dp[i - 1] + dp[i - 2];
   }
-  return total;
+  
+  return dp[n];
 }