迷宫求解问题

写的不好，还可以改进。。。代码如下

#include<stdio.h>

#include<stdlib.h>
#include<malloc.h>
#define stack_size 100
#define ADDLENGTH 10


typedef struct
{
int x;
int y;
} postype;
typedef struct
{
int ord;
postype seat;
int di;
}elemtype;
typedef struct
{
elemtype *base;
elemtype *top;
int size;
}sqstack;
int flag = 0;


void initstack(sqstack *s)
{
s->base = (elemtype *)malloc(stack_size * sizeof(elemtype));
if (!s->base) exit(0);
s->top = s->base;
s->size = stack_size;
return;
}//建立空栈
int stackempty(sqstack *s)//判定栈是否为空
{
if (s->top == s->base)//判定栈顶、栈底指针是否指向同一位置
return(1);
else return(0);
}
void push(sqstack *s, elemtype e)//往栈顶加元素
{
if (s->top - s->base == s->size - 1)//长度将达到当前的上限值
{
realloc(s->base, (s->size + ADDLENGTH)*sizeof(elemtype));//增加存储空间
s->top = s->base + (s->size - 1);
s->size += ADDLENGTH;
}
(*(s->top)).ord = e.ord;
(*(s->top)).seat.x = e.seat.x;
(*(s->top)).seat.y = e.seat.y;
(*(s->top)).di = e.di;
s->top++;
}
void pop(sqstack *s, elemtype *e)//删除栈顶数据
{
if (s->top == s->base) { exit(0); }
(s->top)--;
e->ord = (*(s->top)).ord;
e->seat.x = (*(s->top)).seat.x;
e->seat.y = (*(s->top)).seat.y;
e->di = (*(s->top)).di;
return;
}
void clearstack(sqstack *s)//将s栈清空
{
s->top = s->base;
s->size = 0;
}


void nextpath(postype *tp, int d)
{
switch (d)
{
case 1:tp->y++; break;
case 2:tp->x++; break;
case 3:tp->y--; break;
case 4:tp->x--; break;
}
}
void mazepath(int(*maze)[10])
{
int i, j;
printf("打印迷宫:\n");
for (i = 0; i<10; i++)
{
for (j = 0; j<10; j++)
{
printf("%d", maze[i][j]);


}
printf("\n");
}
elemtype e;
postype curpos;
sqstack s;
initstack(&s);
curpos.x = 1;
curpos.y = 1;
int p = 8, q = 8;
int mark[10][10] = { 0 };
int curstep = 1;
do
{
if (maze[curpos.x][curpos.y] == 0 && mark[curpos.x][curpos.y] == 0)
{
mark[curpos.x][curpos.y] = 1;
e.ord = curstep;
e.seat.x = curpos.x;
e.seat.y = curpos.y;
e.di = 1;
push(&s, e);
printf("(%d,%d)\n", e.seat.x, e.seat.y);
if (curpos.x == p && curpos.y == q)
{
flag = 1;
printf("%d\n", curstep);
printf("走出的路径为");
while (stackempty(&s)==0)
{
pop(&s, &e);
printf("<--(%d,%d)", e.seat.x, e.seat.y);
}
printf("<--[起点]");
printf("\n");
clearstack(&s);
}
nextpath(&curpos, 1);
curstep++;
}//if
else
{
if (stackempty(&s) == 0)
pop(&s, &e);
while (e.di == 4 && stackempty(&s) == 0)
{
mark[curpos.x][curpos.y] = 1;
pop(&s, &e);
}
if (e.di < 4)
{
e.di++;
push(&s, e);
curpos.x = e.seat.x;//**curpos=NextPos(e.seat,e,di)
curpos.y = e.seat.y;
nextpath(&curpos, e.di);




}

}
} while (stackempty(&s) == 0);


}






void main()
{
int maze[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, 0, 0, 1, 0, 1, 0, 1,
1, 0, 0, 1, 1, 0, 0, 0, 0, 1,
1, 1, 1, 1, 1, 0, 0, 1, 0, 1,
1, 0, 0, 0, 1, 0, 0, 0, 0, 1,
1, 0, 1, 0, 0, 1, 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 };
mazepath(maze);
return;
}