Hanoi塔问题递归程序(C语言)

#include

#include

#include

typedef struct {

int n;

int re_line;

char x;

char y;

char z;

} Status;

typedef struct {

int len;

Status *data;

} Stack;

void push(Stack &S, int n, int re_line, char x, char y, char z)

{

S.data[S.len].n=n;

S.data[S.len].re_line=re_line;

S.data[S.len].x=x;

S.data[S.len].y=y;

S.data[S.len].z=z;

S.len++;

}

void PrintStack(Stack S, char *str, char *line_number)

{

printf("\n 递归层次:%d %s\n",S.len,str);

printf(" 执行行号:%s\n",line_number);

for (int i=S.len-1; i>=0; i--)

{

printf("│ %d,%d,%c,%c,%c │\n",S.data[i].re_line,S.data[i].n,S.data[i].x,S.data[i].y,S.data[i].z);

}

}

int main()

{

int n;

int return_line=0;

char action[25];

char line_number[25];

Stack S;

Status top;

printf("***Hanoi***\n盘子总数n=");

scanf("%d",&n);

S.data=(Status*)malloc(n*sizeof(Status));

S.len=0;

push(S,n,0,'a','b','c');

while (S.len>0)

{

top=S.data[S.len-1];

if (top.n==1)

{

strcpy(action,"操作:a-->b");

action[5]=top.x;

action[9]=top.z;

strcpy(line_number,"1,2,3,9");

PrintStack(S,action,line_number);

return_line=top.re_line;

S.len--;

}

else

{

if (return_line==0)

{

strcpy(action,"无操作");

strcpy(line_number,"1,2,4,5");

PrintStack(S,action,line_number);

push(S,top.n-1,6,top.x,top.z,top.y);

return_line=0;

}

if (return_line==6)

{

strcpy(action,"操作:a-->b");

action[5]=top.x;

action[9]=top.z;

strcpy(line_number,"6,7");

PrintStack(S,action,line_number);

push(S,top.n-1,8,top.y,top.x,top.z);

return_line=0;

}

if (return_line==8)

{

strcpy(action,"无操作");

strcpy(line_number,"8,9");

PrintStack(S,action,line_number);

return_line=top.re_line;

S.len--;

}

}

}

printf("\n 操作结束\n\n\n");

system("pause");

}