java汉诺塔代码理解_用Java语言解决的汉诺塔问题的代码

import java.util.Stack;

public class HanoiTower {

public static final int FLOORCOUNT = 3;// 当FLOORCOUNT等于26时,运行时间为7.7秒左右

// 等于27时,15.3秒,等于25时,为3.8秒

@SuppressWarnings("rawtypes")

Stack[] tower = new Stack[3];

public HanoiTower() {

}

// public

@SuppressWarnings("unchecked")

public void initial() {

for (int i = 0; i < 3; i++) {

this.tower[i] = new Stack();

}

for (int i = HanoiTower.FLOORCOUNT; i > 0; i--) {

this.tower[0].push(i);

}

}

@SuppressWarnings("unchecked")

public void moveXTowerTopsToZTower(int startTowerNumber,

int movePlatesCount, int transitTowerNumber, int endTowerNumber) {

if (movePlatesCount == 1) {

System.out.println(startTowerNumber + "->" + endTowerNumber);

this.tower[endTowerNumber].push(this.tower[startTowerNumber].pop());

} else {

this.moveXTowerTopsToZTower(startTowerNumber, movePlatesCount - 1,

endTowerNumber, transitTowerNumber);

System.out.println(startTowerNumber + "->" + endTowerNumber);

this.tower[endTowerNumber].push(this.tower[startTowerNumber].pop());

this.moveXTowerTopsToZTower(transitTowerNumber,

movePlatesCount - 1, startTowerNumber, endTowerNumber);

}

}

public void printTower(Stack Tower) {

System.out.println();

while (!Tower.empty())

System.out.println(Tower.pop());

}

/**

* @param args

*/

@SuppressWarnings("unchecked")

public static void main(String[] args) {

// TODO Auto-generated method stub

HanoiTower ht = new HanoiTower();

ht.initial();

long startTime = System.currentTimeMillis();

ht.moveXTowerTopsToZTower(0, HanoiTower.FLOORCOUNT, 1, 2);

long endTime = System.currentTimeMillis();

System.out.println("运行时间为:" + (endTime - startTime) + "ms");

ht.printTower(ht.tower[2]);

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值