From 73e05940eae0a46fa4921ef1ecfb81fab4f91a76 Mon Sep 17 00:00:00 2001
From: Varun Upadhyay <varun.u28@gmail.com>
Date: Mon, 4 Sep 2017 14:40:12 -0700
Subject: [PATCH] Added bottom up approach

---
 Dynamic Programming/Fibonacci.java | 30 ++++++++++++++++++++++++++++--
 1 file changed, 28 insertions(+), 2 deletions(-)

diff --git a/Dynamic Programming/Fibonacci.java b/Dynamic Programming/Fibonacci.java
index 844beabb4..72048153d 100644
--- a/Dynamic Programming/Fibonacci.java	
+++ b/Dynamic Programming/Fibonacci.java	
@@ -18,7 +18,8 @@ public class Fibonacci {
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         int n = Integer.parseInt(br.readLine());
 
-        System.out.println(fib(n)); // Returns 8 for n = 6
+        System.out.println(fibMemo(n)); // Returns 8 for n = 6
+        System.out.println(fibBotUp(n)); // Returns 8 for n = 6
     }
 
     /**
@@ -28,7 +29,7 @@ public class Fibonacci {
      * Outputs the nth fibonacci number
      **/
 
-    public static int fib(int n) {
+    public static int fibMemo(int n) {
         if (map.containsKey(n)) {
             return map.get(n);
         }
@@ -45,5 +46,30 @@ public class Fibonacci {
 
         return f;
     }
+
+    /**
+     * This method finds the nth fibonacci number using bottom up
+     *
+     * @param n The input n for which we have to determine the fibonacci number
+     * Outputs the nth fibonacci number
+     **/
+
+    public static int fibBotUp(int n) {
+
+        Map<Integer,Integer> fib = new HashMap<Integer,Integer>();
+
+        for (int i=1;i<n+1;i++) {
+            int f = 1;
+            if (i<=2) {
+                f = 1;
+            }
+            else {
+                f = fib.get(i-1) + fib.get(i-2);
+            }
+            fib.put(i, f);
+        }
+
+        return fib.get(n);
+    }
 }