Add Fibonacci and Knapsack java code in DP folder

Author: SagarGaniga

DP/Fibonacci/FiboDP.java

@@ -0,0 +1,26 @@
+class FiboDP{
+
+    int lookup[] = new int[100];
+
+    void init(){
+        for(int i = 0; i< 100; i++){
+            lookup[i] = -1;
+        }
+    }
+
+    int fibo(int n){
+        if(lookup[n]==-1){
+            if(n<=1){
+                lookup[n]=n;
+            }else{
+                lookup[n] = fibo(n-1)+fibo(n-2);
+            }
+        }
+        return lookup[n];
+    }
+    public static void main(String[] args) {
+        FiboDP fb  = new FiboDP();
+        fb.init();
+        System.out.println(fb.fibo(30));
+    }
+}

DP/Knapsack/Knapsack.java

@@ -0,0 +1,38 @@
+class Knapsack 
+{ 
+  
+    // A function that returns maximum of two integers 
+    static int max(int a, int b) { return (a > b)? a : b; } 
+       
+   // Returns maximum value that can be put in a knapsack of capacity W 
+    static int knapSack(int W, int wt[], int val[], int n) 
+    { 
+        int i, w; 
+        int K[][] = new int[n+1][W+1]; 
+       
+        for (i = 0; i <= n; i++) 
+        { 
+            for (w = 0; w <= W; w++) 
+            { 
+                if (i==0 || w==0) 
+                    K[i][w] = 0; 
+                else if (wt[i-1] <= w) 
+                    K[i][w] = max(val[i-1] + K[i-1][w-wt[i-1]],  K[i-1][w]); 
+                else
+                    K[i][w] = K[i-1][w]; 
+            } 
+        } 
+
+        return K[n][W]; 
+    } 
+  
+    
+    public static void main(String args[]) 
+    { 
+        int val[] = new int[]{70, 80, 100}; 
+        int wt[] = new int[]{20, 25, 30}; 
+        int  W = 50; 
+        int n = val.length; 
+        System.out.println(knapSack(W, wt, val, n)); 
+    } 
+}