Time: 0 ms (100.00%), Space: 6 MB (18.24%) - LeetHub

Author: skully-coder

Memoization/509-Fibonacci-Number/509-Fibonacci-Number.cpp

@@ -1,7 +1,17 @@
 class Solution {
 public:
     int fib(int n) {
-        if(n <= 1) return n;
-        return fib(n-1) + fib(n-2);
+        vector<int> F(50);
+        F[0] = 0;
+        F[1] = 1;
+        if(n == 0)
+            return 0;
+        if(n == 1)
+            return 1;
+        for(int i = 2; i<=n; i++)
+        {
+            F[i] = F[i-1] + F[i-2];
+        }
+        return F[n];
     }
 };