Add Tower Of Hanoi recursive implementation

Author: Nikhilesh Satish

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

@@ -1,6 +1,7 @@
 package com.thealgorithms.recursion;
 
 public class TowerOfHanoi {
+
     public void solveHanoi(int n,char src,char dest,char aux)
     {
         if(n==1)
@@ -11,5 +12,7 @@ public void solveHanoi(int n,char src,char dest,char aux)
         solveHanoi(n-1,src,aux,dest);
         System.out.println("Move disk "+n+" from "+src+" to "+dest);
         solveHanoi(n-1,aux,dest,src);
+
     }
+    
 }