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

#include using namespace std;

void hanoi(int n, char a, char b, char c) { if (n == 1) { cout << 'Move disk 1 from ' << a << ' to ' << c << endl; } else { hanoi(n-1, a, c, b); cout << 'Move disk ' << n << ' from ' << a << ' to ' << c << endl; hanoi(n-1, b, a, c); } }

int main() { int n; cout << 'Enter the number of disks: '; cin >> n;

hanoi(n, 'A', 'B', 'C');

return 0;

}