Question

怎样用Java编写汉诺塔程序

Answer 1

package Hanoi;

import java.awt.*;
import java.io.*;
import java.awt.event.*;

public class Hanoi {

public static void main(String args[]) throws IOException {
Hanoi aa = new Hanoi();
aa.go();
}

public void go() throws IOException {
int n;
BufferedReader buf;
buf = new BufferedReader(new InputStreamReader(System.in));
System.out.print("请输入盘数：");
n = Integer.parseInt(buf.readLine());
Hanoi hanoi = new Hanoi();
hanoi.move(n, 'A', 'B', 'C');
}

public void move(int n, char a, char b, char c) {
if (n == 1) {
System.out.println("盘 " + n + " 由 " + a + " 移至 " + c);
} else {
move(n - 1, a, c, b);
System.out.println("盘 " + n + " 由 " + a + " 移至 " + c);
move(n - 1, b, a, c);
}
}
}

Answer 2

用递归 ， 就是自己调用自己方法的那种
package test;

public class test {
public static void main(String args[])
{
System.out.println(method(4));
}
public static int method(int n)
{
System.out.println(n);

if(n==1){
return 1;
}
else
{
return n*method(n-1);
}
}
}