汉诺塔

展示移动过程:

   public static void main(String[] args) {
        doTowers(3,'A','B','C');
    }

    public static void doTowers(int topN,char from,char inter,char to){
        if (topN==1)
            System.out.println("Disk 1 from "+from+" to "+to);
        else {
            doTowers(topN-1,from,to,inter);
            System.out.println("Disk "+topN+" from "+from+" to "+to);
            doTowers(topN-1,inter,from,to);
        }
    }

结果:

Disk 1 from A to C
Disk 2 from A to B
Disk 1 from C to B
Disk 3 from A to C
Disk 1 from B to A
Disk 2 from B to C
Disk 1 from A to C

带元素节点移动的模型:

public class TowersApp {
    static int nDisks=3;

    public static void main(String[] args) {
        Ta ta= new Ta("A");
        for (int i=nDisks;i>0;i--){
            ta.push(i);
        }
        doTowers(nDisks,ta,new Ta("B"),new Ta("C"));
    }
    public static void doTowers(int topN,Ta from,Ta inter,Ta to){
        if (topN==1) {
            System.out.println("Disk 1 from " + from.name + " to " + to.name);
            to.push(from.pop());
            show(from,inter,to);
        }
        else {
            doTowers(topN-1,from,to,inter);
            System.out.println("Disk "+topN+" from "+from.name+" to "+to.name);
            to.push(from.pop());
            show(from,inter,to);
            doTowers(topN-1,inter,from,to);
        }
    }

    private static void show(Ta from, Ta inter, Ta to) {
        System.out.println(from.name+": "+from.list.toString());
        System.out.println(inter.name+": "+inter.list.toString());
        System.out.println(to.name+": "+to.list.toString());
        System.out.println("----------------");
    }
}
public class Ta {
    String name;
    Stack<Integer> list=new Stack<>();

    public Ta(String a) {
        this.name=a;
    }

    public void push(int node){
        this.list.push(node);
    }
    public int pop(){
        return this.list.pop();
    }

    public int getCount(){
        return this.list.size();
    }
}

运行结果:

Disk 1 from A to C
A: [3, 2]
B: []
C: [1]
----------------
Disk 2 from A to B
A: [3]
C: [1]
B: [2]
----------------
Disk 1 from C to B
C: []
A: [3]
B: [2, 1]
----------------
Disk 3 from A to C
A: []
B: [2, 1]
C: [3]
----------------
Disk 1 from B to A
B: [2]
C: [3]
A: [1]
----------------
Disk 2 from B to C
B: []
A: [1]
C: [3, 2]
----------------
Disk 1 from A to C
A: []
B: []
C: [3, 2, 1]
----------------
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值