Create 02 - Top-Down Approach.cpp

Author: JawadSher

24 - Dynamic Programming Problems/01 - Example | Nth Fibonacci Number/02 - Top-Down Approach.cpp

@@ -0,0 +1,13 @@
+class Solution {
+  public:
+    int nthFibonacci(int n) {
+        vector<int> dp(n+1,  -1);
+        
+        if(n == 1 || n == 0) return n;
+        if(dp[n] != -1) return dp[n];
+        
+        dp[n] = nthFibonacci(n-1) + nthFibonacci(n-2);
+        
+        return dp[n];
+    }
+};