在經典的漢諾塔問題中，有 3 個塔和 N 個可用來堆砌成塔的不同大小的盤子。要求盤子必須按照從小到大的順序從上往下堆 （如，任意一個盤子，其必須堆在比它大的盤子上面）。同時，你必須滿足以下限制條件：

(1) 每次只能移動一個盤子。
(2) 每個盤子從堆的頂部被移動後，只能置放於下一個堆中。
(3) 每個盤子只能放在比它大的盤子上面。

請寫一段程式，實現將第一個堆的盤子移動到最後一個堆中。
思路：
我們假設函式hanoi(n, a, b, c)用於將n個圓盤由a移動到c，b作為輔助柱子。

if n!=0 then            ;預定值
  hanoi(n-1, a, c, b)    ;將n-1
 
個盤子由a移動到b，以c為輔助柱子（注意引數順序）
  move(n,a,c)      ;將a上的最後一個盤子移動到c
  hanoi(n-1, b, a, c)    ;將n-1個盤子由b移動到c，以a為輔助柱子
endif                   ;完成

.hpp

#ifndef C227_H
#define C227_H
#include<iostream>
#include<stack>
using namespace std;
class Tower {
private:
    stack<int> disks;
public:
    /*
    * @param i: An integer from 0 to 2
    */
 

    Tower(int i) {
        // create three towers
    }

    /*
    * @param d: An integer
    * @return: nothing
    */
    void add(int d) {
        // Add a disk into this tower
        if (!disks.empty() && disks.top() <= d) {
            printf("Error placing disk %d", d);
        }
        else
 
 {
            disks.push(d);
        }
    }

    /*
    * @param t: a tower
    * @return: nothing
    */
    void moveTopTo(Tower &t) {
        // Move the top disk of this tower to the top of t.
        t.add(disks.top());
        disks.pop();
    }

    /*
    * @param n: An integer
    * @param destination: a tower
    * @param buffer: a tower
    * @return: nothing
    */
    void moveDisks(int n, Tower &destination, Tower &buffer) {
        // Move n Disks from this tower to destination by buffer tower
        if (n <= 0)
            return;
        else if (n == 1)
            moveTopTo(destination);
        else{
            moveDisks(n - 1, buffer, destination);
            moveTopTo(destination);
            buffer.moveDisks(n - 1, destination,*this);
        }
    }

    /*
    * @return: Disks
    */
    stack<int> getDisks() {
        // write your code here
        return disks;
    }
};

#endif
/**
* Your Tower object will be instantiated and called as such :
*vector<Tower> towers;
*for (int i = 0; i < 3; i++) towers.push_back(Tower(i));
*for (int i = n - 1; i >= 0; i--) towers[0].add(i);
*towers[0].moveDisks(n, towers[2], towers[1]);
*print towers[0], towers[1], towers[2]
*/

.cpp

#include"c227.h"
#include<vector>
void print(Tower t)
{
    stack<int> sk = t.getDisks();
    while (!sk.empty())
    {
        cout << sk.top() << " ";
        sk.pop();
    }
    cout << endl;
}
int main()
{
    int n = 5;
    vector<Tower> towers;
    for (int i = 0; i < 3; ++i)
        towers.push_back(Tower(i));
    for (int i = n-1; i >= 0; --i)
        towers[0].add(i);
    towers[0].moveDisks(n, towers[2], towers[1]);
    cout << "towers[0]: " << endl;
    print(towers[0]);
    cout << "towers[1]: " << endl;
    print(towers[1]);
    cout << "towers[2]: " << endl;
    print(towers[2]);
    return 0;
}