C++ 实现汉诺塔问题算法

#include using namespace std;

void hanoi(int n, char A, char B, char C) { if (n == 1) { cout << A << '->' << C << endl; return; } hanoi(n-1, A, C, B); //把n-1个盘子从A经过C移动到B cout << A << '->' << C << endl; //把第n个盘子从A移动到C hanoi(n-1, B, A, C); //把n-1个盘子从B经过A移动到C }

int main() { int n; cin >> n; hanoi(n, 'A', 'B', 'C'); return 0; }