提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
前言
假设有三个分别命名为X、Y和Z的塔座,在塔座X上插有n个直径大小各不相同、依小到大编号为1,2,...,n的圆盘。现要求将X轴上的n个圆盘移至塔座Z上并仍按同样顺序叠排,圆盘移动时必须遵循下列规则:
1)每次只能移动一个圆盘;
2)圆盘可以插在X、Y和Z中的任一塔座上;
3)任何时刻都不能将一个较大的圆盘压在较小的圆盘之上。
提示:以下是本篇文章正文内容,下面案例可供参考
一、输入
1 2 3
二、输出
1. Move disk 1 from X to Z 1. Move disk 1 from X to Y 2. Move disk 2 from X to Z 3. Move disk 1 from Y to Z 1. Move disk 1 from X to Z 2. Move disk 2 from X to Y 3. Move disk 1 from Z to Y 4. Move disk 3 from X to Z 5. Move disk 1 from Y to X 6. Move disk 2 from Y to Z 7. Move disk 1 from X to Z
#include<stdio.h>
#include<stdlib.h>
#define stack_size 1000
#define zeng_size 10
typedef struct
{
int *base;
int *top;
int stacksize;
}Stack;
//初始化-构造一个空栈
int initstack(Stack *s)
{
s->base = (int *)malloc(sizeof(int) * stack_size);
if( !s->base)
{
exit(0);
}
s->top = s->base;
s->stacksize = stack_size;
return 1;
}
// 判断栈是否为空
int stackEnpty(Stack *s)
{
if(s->base == s->top)
{
return 1;
}
return 0;
}
//插入元素x为新的栈顶元素
int push(int x,Stack *s)
{
int *nbase;
if((s->top - s->base) >= s->stacksize)
{
nbase = (int *)realloc(s->base,sizeof(int) * (s->stacksize + zeng_size));
if( !nbase)
{
exit(0);
}
s->base = nbase;
s->stacksize += zeng_size;
}
*(s->top)++ = x;
return 1;
}
//弹出栈顶元素,
int pop(Stack *s,int *e)
{
if(s->base == s->top)
{
return 0;
}
*e = *(--s->top);
return 1;
}
int t=1;
void move(char x,int n,char y)
{
printf("%2d. Move disk %d from %c to %c\n",t++,n,x,y);
}
void Hanoi(int n,char x,char y,char z)
{
if (n==1)
{
move(x,1,z);
}
else
{
Hanoi(n-1,x,z,y);
move(x,n,z);
Hanoi(n-1,y,x,z);
}
}
int main()
{
int n;
while (scanf("%d",&n)!=EOF)
{
Hanoi(n,'X','Y','Z');
t=1;
printf("\n");
}
return 0;
}