大家帮忙完成一下迷宫哈，谢谢了

2008-12-09 09:57:26 168 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

啊哈算法之解救小哈题目描述有一天，小哈一个去玩迷宫。但是方向感很不好的小哈很快就迷路了。小哼得知后便立即去解救无助的小哈。小哼当然是有备而来，已经弄清楚了迷宫地图，现在小哼要以最快速度去解救小哈。问题就此开始了…… 迷宫由n×m列的单元格组成，每个单元格要么是空地，要么是障碍物。你的任务是帮助小哼找到一条从迷宫的起点到小哈所在位置的最短路径，注意障碍物是不能走的，当然也不能走到迷宫之外。n,m≤100。输入第一行有两个数n 和m。n表示迷宫的行，m表示迷宫的列。接来下来n行m列为迷宫，0表示空地，1表示障碍物。最后一行阅读详情

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define true 1
#define false 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define RANGE 12
#define STACK_INIT_SIZE 100
typedef int Status;
typedef int bool;
typedef struct
{
int x;
int y;
}PosType;
typedef struct
{
char arr[RANGE][RANGE];
}MazeType; //迷宫类型
typedef struct
{
int ord;
int di;
PosType seat;
}SElemType;/*坐标位置类型*/
typedef struct
{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
Status InitStack(SqStack *S) /*初始化栈，设栈为空栈*/
{
S->base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S->base)
exit(OVERFLOW);
S->top=S->base;
S->stacksize=STACK_INIT_SIZE;
return OK;
}
bool Pass(MazeType *M,PosType pos) /*检查是否为空格*/
{
if(M->arr[pos.x][pos.y]==' ')
return true;
else
return false;
}
void FootPrint(MazeType *M,PosType pos) /*将该位置标记已走*/
{
M->arr[pos.x][pos.y]='*';
}
Status Push(SqStack *S,SElemType e)
{
if(S->top-S->base>=S->stacksize)
{
S->base=(SElemType *)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S->base) exit(OVERFLOW);
S->top=S->base+S->stacksize;
S->stacksize+=STACKINCREMENT;
}
*S->top++=e;
return OK;
}
PosType NextPos(PosType pos,int i) /*求当前位置的下一个探索位置*/
{
switch(i)
{
case 1:
pos.y++;
break;
case 2:
pos.x++;
break;
case 3:
pos.y--;
break;
case 4:
pos.x--;
break;
}
return pos;
}
Status StackEmpty(SqStack *S)
{
if (S->top==-1)
return(1); //空栈则返回１
else
return(0);
}
void pop(SqStack *S)
{
if (S->top==-1)
printf("栈下溢出!\n");
else
S->top--;
}
void MarkPrint(MazeType *M,PosType pos) /*将该位置标记为死胡同*/
{
M->arr[pos.x][pos.y]='@';
}
Status MazePath(MazeType *maze,PosType start,PosType end)
{
SqStack S;
SElemType e;
PosType curpos;
int curstep=1;
InitStack(&S);
curpos=start;
e.ord=curstep;e.seat=curpos;e.di=1;
do
{
if(Pass(maze,curpos))
{
FootPrint(maze,curpos);
Push(S,&e);
if(curpos==end)
return true;
curpos=NextPos(curpos,1);
curstep++;
}
else(!StackEmpty(S))
{
Pop(&S,&e);
while(e.seat==4&&!StackEmpty(S))
{
MarkPrint(maze,e.seat);
Pop(&S,&e);
}
if(e.di<4)
{
e.di++;
Push(&S,e);
curpos=NextPos(e.seat,e.di);
}
}
}while(!StackEmpty(S));
return (false);
}

void main()
{
PosType char arr[12][12]={
{'X','X','X','X','X','X','X','X','X','X','X','X'},
{'X','.','.','.','.','.','.','X','.','X','X','X'},
{'X','.','X','.','X','X','.','.','.','.','.','X'},
{'X','.','X','.','X','X','.','X','X','X','.','X'},
{'X','.','X','.','.','.','.','.','X','.','.','X'},
{'X','.','X','X','X','X','X','X','X','X','X','X'},
{'X','.','.','.','X','.','X','.','.','.','.','X'},
{'X','.','X','X','X','.','.','.','X','X','X','X'},
{'X','.','.','.','.','.','X','X','.','.','.','X'},
{'X','X','X','.','X','X','X','X','.','X','.','X'},
{'X','X','X','X','X','X','X','X','.','X','X','X'},
{'X','X','X','X','X','X','X','X','X','X','X','X'},
};
MazePath(

}

...全文