递归经典算法:
汉诺塔:
#include <iostream>
int hanoi(int n,char a,char b,char c)
{
if (n>=1)
{
hanoi(n-1,a,c,b);
std::cout<<a<<"-->"<<c<<std::endl;
hanoi(n-1,b,a,c);
}
else
return 0;
}
int main()
{
std::cout<<"Hello World!"<<std::endl;
//int m=2;
std::cin>>m;
hanoi(m,'A','B','C');
std::cout<<"WTF"<<std::endl;
return 0;
}