Formatted KnapsackMemoization.java and optimized algorithm

Author: Chiefpatwal

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

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