Optimized KnapsackMemoization algorithm

Author: Chiefpatwal

src/main/java/com/thealgorithms/dynamicprogramming/KnapsackMemoization.java

@@ -19,7 +19,7 @@ int knapSack(int capacity, int[] weights, int[] profits, int numOfItems) {
 
         // Loop to initially fill the table with -1
         for(int []table:dpTable){
-            Arrays.fill(table,-1);g
+            Arrays.fill(table,-1);
         }
 
         return solveKnapsackRecursive(capacity, weights, profits, numOfItems, dpTable);