8.6 汉诺塔问题

     《程序员面试金典》（第六版）习题：仅为记录一下以加强印象，不为商业用途，如有侵权请联系删除。以下源码和解释参考了书中源码以及解释。
     算法的基本思想是：要将n个顺序堆叠的碟子从$colum{n}_1$借助$colum{n}_2$整体保持原有的堆叠顺序移动到$colum{n}_3$可以先将$colum{n}_1$上面的$n-1$个顺序堆叠的碟子整体保持原有的堆叠顺序移动到$colum{n}_2$然后将$colum{n}_1$上面的最后一个碟子移动到$colum{n}_3$最后将$colum{n}_2$上$n-1$个顺序堆叠的碟子整体保持原有的堆叠顺序移动到$colum{n}_3$。算法为递归算法。测试结果如图1所示。递归调用流图如图2所示。

class Tower
{
    private:
		stack<int> disks;
		int index;
    public:
		Tower(int i)
		{
			index = i;
		}
		int getIndex()
		{
			return index;
		}
		void add(int d)
		{
		    //当disks不为空时disks的栈顶元素必须大于插入的元素
			if (!disks.empty() && disks.top() <= d)
			{
				cout << "Placing disks error!!!"<< endl;
			}
			else
			{
				disks.push(d);
			}
		}
		void moveTopTo(Tower *t)
		{
			cout << "moveTopTo::Tower id=" << this->index << endl;
			int top = disks.top();
			cout << "moveTopTo::top=" << top << endl;
			disks.pop();
			t->add(top);
		}
		void moveDisks(int n, Tower *destination, Tower *buffer)
		{
		    cout << "moveDisks::Tower id=" << this->index << endl;
			cout << "moveDisks::n=" <<n<< endl;
			if (n > 0)
			{
				moveDisks(n - 1, buffer, destination);
				moveTopTo(destination);
				buffer->moveDisks(n - 1, destination, this);
			}
		}
		void printTower()
		{
			while (!disks.empty())
			{
				cout << disks.top()<<endl;
				disks.pop();
			}
		}
};

int main()
{
    //这里的n值不能取得太大否则运行时间会比较长搞得你以为是程序哪里出问题了！！！！！
	int n = 3;
	Tower one(0);
	Tower two(1);
	Tower three(2);
	for (int i = n ; i > 0; i--)
	{
		one.add(i);
	}
	one.moveDisks(n, &three, &two);
	three.printTower();
}

　

图1.

　

图2.