2021-7-12汉诺塔问题

---

前言

---

提示：以下是本篇文章正文内容，下面案例可供参考

代码如下

#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
//汉诺塔问题
void move(char src, char dest) {
    cout << src << "-->" << dest << endl;
}
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 number of diskes: ";
    cin >> m;
    cout << "the steps to moving " << m << " diskes:" << endl;
    hanoi(m, 'A', 'B', 'C');
    return 0;
}

总结

建议从3开始尝试学习