hanoi1.cpp

来自「一本全面剖析C++数据结构算法的书籍」· C++ 代码 · 共 20 行

// Towers of Hanoi

#include <iostream.h>

void TowersOfHanoi(int n, int x, int y, int z)
{// Move the top n disks from tower x to tower y.
 // Use tower z for intermediate storage.
   if (n > 0) {
      TowersOfHanoi(n-1, x, z, y);
      cout << "Move top disk from tower " << x 
           << " to top of tower " << y << endl;
      TowersOfHanoi(n-1, z, y, x);}
}

void main(void)
{
   cout << "Moves for a three disk problem are" << endl;
   TowersOfHanoi(3,1,2,3);
}