Solution for Tower of Hanoi problem using recursion

Author: Nikhilesh Satish

src/main/java/com/thealgorithms/recursion/TowerOfHanoi.java

@@ -3,7 +3,8 @@
 /*Tower of Hanoi Problem on Wikipedia - https://en.wikipedia.org/wiki/Tower_of_Hanoi */
 
 public final class TowerOfHanoi {
-    private TowerOfHanoi(){}
+    private TowerOfHanoi() {
+    }
     public static void solveHanoi(int n, char src, char dest, char aux) {
         if (n == 1) {
             System.out.println("Move disk 1 from " + src + " to " + dest);