Hanoi Tower求解

最新推荐文章于 2020-02-29 20:18:06 发布

原创最新推荐文章于 2020-02-29 20:18:06 发布 · 416 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#string

本文介绍了一种使用递归算法解决汉诺塔问题的方法。通过递归调用自身函数，实现将不同数量的盘子从初始柱子移动到目标柱子的过程，并详细展示了递归的逻辑实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/*
    递归实现hanoi塔问题
将盘子从x借助y移到z
*/
void CRecursion::hanoi(int count, string x, string y, string z)
{
/*
if(count == 1)
  cout<< "move " << count << " from " << x << " to " << z << endl;
else
{
  hanoi(--count, x, z, y);
  cout << "move " << count+1 << " from " << x << " to " << z << endl;
  hanoi(--count, y, z, x);
  cout << "move " << count+1 << " from " << y << " to " << z << endl;
}
*/

if(count == 1)
  cout<< "move " << count << " from " << x << " to " << z << endl;
else
{
  hanoi(count-1, x, z, y);
  cout << "move " << count << " from " << x << " to " << z << endl;
  hanoi(count-1, y, x, z);
}

}

void main()

{

/////////////////////////////////////////////
//////// 递归实现hanoi塔 ////////////
int count = 3;
string x = "one", y = "two", z = "three";
CRecursion m_Recursion;
m_Recursion.hanoi(count, x, y, z);

}