Question

求Java汉诺塔游戏 程序

Answer 1

import javax.swing.JOptionPane;
public class TowersOfHanoi
{
/** Main method */
public static void main(String[] args)
{
// Read number of disks, n
String intString = JOptionPane.showInputDialog(null,
"Enter number of disks:");
// Convert string into integer
int n = Integer.parseInt(intString);
// Find the solution recursively
System.out.println("The moves are:");
moveDisks(n, 'A', 'B', 'C');
}

/** The method for finding the solution to move n disks
from fromTower to toTower with auxTower */
public static void moveDisks(int n, char fromTower,
char toTower, char auxTower)
{
if (n == 1) // Stopping condition
System.out.println("Move disk " + n + " from " +
fromTower + " to " + toTower);
else
{
moveDisks(n - 1, fromTower, auxTower, toTower);
System.out.println("Move disk " + n + " from " +
fromTower + " to " + toTower);
moveDisks(n - 1, auxTower, toTower, fromTower);
}
}
}

Answer 2

import javax.swing.JOptionPane;
public class TowersOfHanoi
{
/** Main method */
public static void main(String[] args)
{
// Read number of disks, n
String intString = JOptionPane.showInputDialog(null,
"Enter number of disks:");
// Convert string into integer
int n = Integer.parseInt(intString);
// Find the solution recursively
System.out.println("The moves are:");
moveDisks(n, 'A', 'B', 'C');
}

/** The method for finding the solution to move n disks
from fromTower to toTower with auxTower */
public static void moveDisks(int n, char fromTower,
char toTower, char auxTower)
{
if (n == 1) // Stopping condition
System.out.println("Move disk " + n + " from " +
fromTower + " to " + toTower);
else
{
moveDisks(n - 1, fromTower, auxTower, toTower);
System.out.println("Move disk " + n + " from " +
fromTower + " to " + toTower);
moveDisks(n - 1, auxTower, toTower, fromTower);
}
}
}