// 汉诺塔 void HanoiTower(int n, char from, char to, char middle) { if(n <= 0) return; HanoiTower(n-1, from, middle, to); std::cout << "Move Top Disk From " << from << " to " << to << std::endl; HanoiTower(n-1, middle, to, from); } int _tmain(int argc, _TCHAR* argv[]) { HanoiTower(64, 'A', 'B', 'C'); return 0; }
汉诺塔(Hanoi Tower)的实现
最新推荐文章于 2022-07-15 12:01:08 发布