程序员面试金典——3.4汉诺塔

Solution1：

典型的递归题。参考的清华大学郑莉老师的C++讲义中的答案。

#include<iostream>
using namespace std;
//将src针最上面一个盘子移动到dest针上
void move(char src, char dest) {
    cout << src << " --> " << dest << endl;
}
//将n个盘子从src指针移动到dest指针上，以medium指针作为中转
void Hanoi(int n, char src, char medium, char dest) {
    if (n == 1)
        move(src, dest);
    else {
        Hanoi(n - 1, src, dest, medium);
        move(src, dest);
        Hanoi(n - 1, medium, src, dest);
    }
}

int main() {
    int m;
    cout << "Enter the numbers of diskes: " << endl;
    cin >> m;
    cout << "the steps to moving " << m << " diskes: " << endl;
    Hanoi(m, 'A', 'B', 'C');
    return 0;
}