Programming: Recursive programming solves the problem of the Nottingham Tower (implemented in Java)

Li Cuiyun,october 14,2016.
Using recursive method to solve the problem of the Han-nuo tower
Package tutorial_3_5;
Import java.util.*;

public class Hanoitower {

public static void Main (string[] args) {
TODO auto-generated Method Stub

@SuppressWarnings ("resource")
Scanner sc=new Scanner (system.in);
int n;
System.out.println ("Please enter the number of your dished (Hanoi Tower):");
N=sc.nextint ();
System.out.println ("The number of the times you need to move the dishes is:" +new hanoitower (). Hanoitower (n));

}

public int Hanoitower (int n)
{if (n==1) return 1;
else return Hanoitower (n-1) *2+1;
}

}

Programming: Recursive programming solves the problem of the Nottingham Tower (implemented in Java)