第C語言通過棧實現(xiàn)小人走迷宮if(s-Top-s-Base=s-size){

s-Base=(ElemType*)realloc(s-Base,(s-size+INIT_INCREM)*sizeof(ElemType));

if(s-Base==NULL){

return0;

}

s-Top=s-Base+s-size;

s-size=s-size+INIT_INCREM;

}

*s-Top=*e;

s-Top++;

return1;

intPop(STACK*s,ElemType*e){

if(s==NULL||e==NULL){

return0;

}

if(s-Base==s-Top){

return0;

}

s-Top--;

*e=*s-

return1;

intIsEmpty(STACK*

s){

returns-Base==s-Top1:0;

}

新建Data.h

#ifndef_DATA_H

#define_DATA_H

typedefstruct

{

inty;

intx;

}POS;

typedefstruct{

intord;

POSseat;

intdi;

}ElemType;

#endif

新建main.c

#include"Data.h"

#include"stack.h"

#includestdio.h

#includeconio.h

#includestdlib.h

intitem[10][10]={

{1,1,1,1,1,1,1,1,1,1},

{1,0,0,1,0,0,0,1,0,1},

{1,0,0,1,0,0,0,1,0,1},

{1,0,0,0,0,1,1,0,0,1},

{1,0,1,1,1,0,0,0,0,1},

{1,0,0,0,1,0,0,0,0,1},

{1,0,1,0,0,0,1,0,0,1},

{1,0,1,1,1,0,1,1,0,1},

{1,1,0,0,0,0,0,0,0,1},

{1,1,1,1,1,1,1,1,1,1}

staticconstPOSinPos={1,1},outPos={8,8};

intIsPass(POSCurP){

returnitem[CurP.y][CurP.x]==01:0;

POSNextPos(POSCurP,intdi){

POSp=CurP;

switch(di){

case0:

p.x--;//向左

break;

case1:

p.y++;//向下

break;

case2:

p.x++;//向右

break;

case3:

p.y--;//向上

break;

}

returnp;

voidPrintItem(POSCurP){

inti,j;

system("cls");

for(i=0;ii++){

for(j=0;jj++){

if(i==CurP.yj==CurP.x){

printf("@");

continue;

}

if(item[i][j]==1){

printf("*");

}else{

printf("");

}

}

printf("\n");

}

voidmain(){

STACK*s=InitStack();

ElemTypee;

intsetp=1;

POSCurPos=inPos;

PrintItem(inPos);

do{

if(IsPass(CurPos)){

e.ord=setp;

e.di=0;

e.seat=CurPos;

Push(s,//只有能通過才壓棧

item[CurPos.y][CurPos.x]=2;

if(CurPos.y==outPos.yCurPos.x==outPos.x){

PrintItem(CurPos);

printf("ok!\n");

break;

}

PrintItem(CurPos);

CurPos=NextPos(e.seat,0);

setp++;

getch();

}else{

Pop(s,//如果不能通過就彈棧

if(e.di==4!IsEmpty(s)){

item[CurPos.y][CurPos.x]=8;

Pop(s,

}

if(e.di3){

e.di++;