Tower of Hanoi
来源:互联网 发布:支付宝能解绑淘宝号码 编辑:程序博客网 时间:2024/05/17 06:44
#include <stdio.h>#include <stdlib.h>void towerOfHanoi(int n, char from, char to, char temp);int main(){ towerOfHanoi(5,'A','C','B'); return 0;}void towerOfHanoi(int n, char from, char to, char temp){ if(n > 0){ towerOfHanoi(n-1, from, temp, to); printf("move from disk %d from %c to %c\n", n,from, to); towerOfHanoi(n-1, temp, to, from); }}
- THE TOWER OF HANOI
- Tower of Hanoi
- Tower of Hanoi
- Tower of Hanoi
- Tower of Hanoi问题
- codeforces Tower of Hanoi
- Tower of Hanoi
- 汉诺塔 Tower of Hanoi
- THE TOWER OF HANOI
- pku 3601 Tower of Hanoi
- 汉诺塔(the Tower of Hanoi )
- 1.1 The Tower of Hanoi
- poj 3601 Tower of Hanoi
- Tower of Hanoi by C++
- POJ 3601:Tower of Hanoi
- 1-6 Tower of Hanoi
- POJ 3601 Tower of Hanoi
- Tower of Hanoi(汉诺塔)
- JAVA线程池Executor的简单使用
- 关于widthStep造成的问题
- C++动态创建二维数组
- Reverse a positive number
- 微软SQLHelper.cs类 中文版 笔记
- Tower of Hanoi
- 第六章 面向对象的程序设计(二) JavaScript高级程序设计
- I2c通信问题分析(欢迎高手补充)
- 杭电2047
- Wireshark 保存Filter的删除方法
- oracle procedure
- 10进制和26进制互转
- git - error: failed to push some refs to 'https://github.com/xuzhezhaozhao/Practice.git' 解决办法
- 链表小结