Hanoi塔问题——递归

/Hanoi塔问题///
#include<iostream>
using namespace std;
void hanoi(int i,char A,char B,char C);
void move(int i,char x,char y);
int main()
{
int n;
cin>>n;
hanoi(n,'A','B','C');
return 0;
}
void hanoi(int i,char A,char B,char C)
{
if(i==1)
{
move(1,A,C);
}
else
{
hanoi(i-1,A,C,B);
move(i,A,C);
hanoi(i-1,B,A,C);
}
}
void move(int i,char x,char y)
{
static int c=1;
cout<<c++<<":"<<i<<" from "<<x<<"—>"<<y<<endl;
}

转载于:https://www.cnblogs.com/rswss/p/5953162.html