版权声明:本文为@那年聪聪 原创文章,未经博主允许不得转载。 https://blog.csdn.net/duan19920101/article/details/55510827
汉诺塔的递归实现方法
//n-num a-from b-temp c-to
void hano(int n, char a, char b, char c)
{
if (n == 1)
cout << a << "=>" << c << endl;
else
{
hano(n - 1, a, c, b);
hano(1, a, b, c);
hano(n - 1, b, a, c);
}
}
int main()
{
hano(2, 'A', 'B', 'C');
cout << "汉诺塔移动完成!" << endl;
cout << endl;
return 0;
}