汉诺塔问题java代码_汉诺塔问题编程算法

package com.wangyq.datastructrue.arithmetic;
import java.util.Arrays;
import java.util.Stack;
/** * 分治算法-汉罗塔 */
public class DivideAndConquer { 

public static void main(String[] args) { 

//定义一个汉罗塔
TowerofHanoi towerofHanoi = new TowerofHanoi(4);
towerofHanoi.show();
towerofHanoi.hannoi();
}
}
class TowerofHanoi { 

int tier = 0;
Stack column1 = new Stack();
Stack column2 = new Stack();
Stack column3 = new Stack();
TowerofHanoi(int tier) { 

this.tier = tier;
//初始化汉罗塔
for (int i = tier; i > 0; i--) { 

column1.push(i);
}
}
/** * 打印汉罗塔 */
public void show() { 

System.out.println("汉罗塔：");
System.out.println("第一根柱子" + Arrays.toString(column1.toArray()));
System.out.println("第二根柱子" + Arrays.toString(column2.toArray()));
System.out.println("第三根柱子" + Arrays.toString(column3.toArray()));
}
public void hannoi() { 

move(tier, column1, column2, column3);
}
/** * 汉罗塔移动 */
public void move(int tier, Stack stack1, Stack stack2, Stack stack3) { 

if (tier == 1) { 

//只有一个直接移上去
stack3.push(stack1.pop());
show();
} else { 

//
move(tier - 1, stack1, stack3, stack2); //将n-1个在A柱子的盘子通过c柱子移动到B柱子
stack3.push(stack1.pop());
show();                                       //将A柱子上编号为n的盘子移动到c柱子
move(tier - 1, stack2, stack1, stack3);  //将在B柱子的n-1盘子通过A柱子移动到C柱子
}
}
}