设为首页 加入收藏

TOP

问题九十一:汉诺塔
2014-11-23 22:25:28 来源: 作者: 【 】 浏览:2
Tags:问题 九十一 汉诺


[plain]
#include

void hanol(int num, char a, char b, char c);

int main()
{
int num;
char a='A';
char b='B';
char c='C';

printf("please enter a number:");
scanf("%d", &num);

hanol(num, a, b, c);

return 0;
}
void hanol(int num, char a, char b, char c)
{
if(num==1)
{
printf("Move disk %d from %c to %c\n",num, a, c);
}
else
{
hanol(num-1, a, c, b);
printf("Move disk %d from %c to %c\n",num, a, c);
hanol(num-1, b, a, c);
}
}

#include

void hanol(int num, char a, char b, char c);

int main()
{
int num;
char a='A';
char b='B';
char c='C';

printf("please enter a number:");
scanf("%d", &num);

hanol(num, a, b, c);

return 0;
}
void hanol(int num, char a, char b, char c)
{
if(num==1)
{
printf("Move disk %d from %c to %c\n",num, a, c);
}
else
{
hanol(num-1, a, c, b);
printf("Move disk %d from %c to %c\n",num, a, c);
hanol(num-1, b, a, c);
}
}

\

】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇问题九十:Fibonacci数用数组(续.. 下一篇问题九十二:字符统计

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: