经典题,过程类似于栈,将问题不断分解为一步就能完成的任务
#include<iostream>
using namespace std;
void Hanoi(int n, char left ,char mid ,char right)
{
if(n==1)
{
cout << n << ":" << left << "->" << right << endl;
return;
}
Hanoi(n-1,left,right,mid);
cout << n << ":" << left << "->" << right << endl;
Hanoi(n-1,mid,left,right);
return;
}
int main()
{
int n;
char a,b,c;
cin >> n >> a >> b >> c;
Hanoi(n,a,b,c);
}