Refactor code formatting in KnapsackMemoization.java and UnionFind.java

Author: CodaBlurd

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

@@ -41,8 +41,8 @@ int solveKnapsackRecursive(int capacity, int[] weights, int[] profits, int numOf
             return dpTable[numOfItems][capacity];
         } else {
             // case 1. include the item, if it is less than the capacity
-            int includeCurrentItem = profits[numOfItems - 1]
-                    + solveKnapsackRecursive(capacity - weights[numOfItems - 1], weights, profits, numOfItems - 1, dpTable);
+            int includeCurrentItem = profits[numOfItems - 1] + solveKnapsackRecursive(capacity - weights[numOfItems - 1], weights, profits, numOfItems - 1, dpTable);
+
 
             // case 2. exclude the item if it is more than the capacity
             int excludeCurrentItem = solveKnapsackRecursive(capacity, weights, profits, numOfItems - 1, dpTable);

src/main/java/com/thealgorithms/searches/UnionFind.java

@@ -25,8 +25,9 @@ public int find(int i) {
             return i;
         }
 
-       int result = find(parent);
-         p[i] = result;
+        int result = find(parent);
+        p[i] = result;
+
         return result;
     }