汉诺塔Hanoi - 递归

package com.metka.algorithm;

import java.util.ArrayDeque;
import java.util.Deque;

public class Hanoi {
	
	public static void main(String[] args) {
		Deque<String> queue = new ArrayDeque<String>();
		queue.addFirst("1");
		queue.addFirst("2");
		queue.addFirst("3");
		execHanoi(queue, "A", "B", "C");
	}
	
	
	// 从A 到C  中间B过渡
    // 用双向队列模拟小木块
	public static void execHanoi(Deque<String> queue,String A,String B,String C) {
		
		if(queue.size() == 1) {
			opera(queue.poll(),A, C);
			return;
		}
		String remove = queue.removeFirst();
		Deque<String> remain = new ArrayDeque<String>();
		remain.add(remove);

		Deque<String> d = new ArrayDeque<String>();
		d.addAll(queue);
		execHanoi(queue, A, C, B);
		execHanoi(remain, A, B, C);

        //需要用新的一个队列模拟，不然用queue的话会在上面的操作改变数据
		execHanoi(d, B, A, C);
	}
	
	
	public static void opera(String name,String src,String dest) {
		
		System.out.println(name + " :"+src + "--" +dest);
	}
}

执行结果：

1 :A--C
2 :A--B
1 :C--B
3 :A--C
1 :B--A
2 :B--C
1 :A--C