迷宫问题

///==============================迷宫问题======================================///如有BUG或意见，联系邮箱:[e-mail]#include <stdio.h>#include <stdlib.h>#include <string.h>#define W 1000 ///宽的最大值#define H 1000 ///高的最大值#define STACK_INIT_SIZE 100#define STACKINCREMENT 20struct Coordinate{ int x,y;}; //构造结构体，表示坐标位置typedef struct //构造栈结构体{ Coordinate *base; Coordinate *top; int stacksize;} MazeStack;void InitMaze(char MazeFigure[ ][W],Coordinate &Enter, Coordinate &Exit,int high,int wide)///初始化迷宫{ int i = 0,j = 0; for(; i + 1 <= high; i++) { for(j = 0; j + 1 <= wide; j++) { scanf("%c",&MazeFigure[i][j]); getchar(); if(MazeFigure[i][j] == '3') { Enter.x = j ; Enter.y = i ; MazeFigure[i][j] = '1'; } else if(MazeFigure[i][j] == '4') { Exit.x = j ; Exit.y = i ; MazeFigure[i][j] = '0'; } } }}void OutputMazeFigure(char MazeFigure[ ][W],int high,int wide){ int i , j; for(i = 0; i + 1 <= high; i++) { for(j = 0; j + 1 <= wide; j++) { printf("%c ",MazeFigure[i][j]); } puts(""); }}void InitStack(MazeStack &MazeSolution){ MazeSolution.base = (Coordinate*)malloc(STACK_INIT_SIZE*sizeof(Coordinate)); if(!MazeSolution.base) { puts("内存非配失败."); exit(0); } MazeSolution.top = MazeSolution.base; MazeSolution.stacksize = STACK_INIT_SIZE;}void Push(MazeStack &MazeSolution,Coordinate Elem) ///插入新的栈顶元素{ if(MazeSolution.top - MazeSolution.base >= MazeSolution.stacksize) { MazeSolution.base = (Coordinate*)realloc(MazeSolution.base, (MazeSolution.stacksize + STACKINCREMENT)*sizeof(Coordinate)); if(!MazeSolution.base) { puts("内存非配失败."); exit(0); } MazeSolution.top = MazeSolution.base + MazeSolution.stacksize; MazeSolution.stacksize += STACKINCREMENT; } *MazeSolution.top++ = Elem;}void Pop(MazeStack &MazeSolution,Coordinate &Elem)///删除栈顶元素{ if(MazeSolution.base != MazeSolution.top) { MazeSolution.top--; Elem = *(MazeSolution.top - 1); }}void SearchMazePath(char MazeFigure[][W],Coordinate Enter,Coordinate Exit,int high,int wide);void OutputMazePath(MazeStack MazeSolution);///输出迷宫解///主函数部分int main(void){ char MazeFigure[H][W]; Coordinate Enter; Coordinate Exit; int high,wide; scanf("%d%d",&wide,&high); getchar(); InitMaze(MazeFigure,Enter,Exit,high,wide); SearchMazePath(MazeFigure,Enter,Exit,high,wide); return 0;}///搜索迷宫路径void SearchMazePath(char MazeFigure[][W],Coordinate Enter, Coordinate Exit,int high,int wide){ MazeStack MazeSolution; Coordinate Temp = Enter; InitStack(MazeSolution); Push(MazeSolution,Enter); /** 迷宫是一个二维矩阵, 其中1为墙,0为路,3为入口,4为出口. 要求从入口开始,从出口结束, 按照 下,左,上,右 的顺序来搜索路径. **/ while(!((MazeSolution.top- 1)->x == Exit.x && (MazeSolution.top- 1)->y == Exit.y)) { if(MazeSolution.base == MazeSolution.top) { puts("死迷宫."); exit(0); } if((MazeFigure[Temp.y + 1][Temp.x] == '0') && ///下 (Temp.y + 2 <= high && Temp.x + 1 <= wide)) { MazeFigure[Temp.y + 1][Temp.x] = '1'; Temp.y ++; Push(MazeSolution,Temp); } else if((MazeFigure[Temp.y][Temp.x - 1] == '0') && ///左 (Temp.y + 1 <= high && Temp.x <= wide) && (Temp.x - 1 >= 0)) { MazeFigure[Temp.y][Temp.x - 1] = '1'; Temp.x--; Push(MazeSolution,Temp); } else if((MazeFigure[Temp.y - 1][Temp.x] == '0') && ///上 (Temp.y <= high && Temp.x + 1 <= wide) && (Temp.y - 1 >= 0)) { MazeFigure[Temp.y - 1][Temp.x] = '1'; Temp.y--; Push(MazeSolution,Temp); } else if((MazeFigure[Temp.y][Temp.x + 1] == '0') && (Temp.y + 1 <= high && Temp.x + 2 <= wide)) ///右 { MazeFigure[Temp.y][Temp.x + 1] = '1'; Temp.x ++; Push(MazeSolution,Temp); } else { Pop(MazeSolution,Temp); } } OutputMazePath(MazeSolution);}void OutputMazePath(MazeStack MazeSolution){ while(MazeSolution.base != MazeSolution.top) { printf("%d %d/n",MazeSolution.base->x,MazeSolution.base->y); MazeSolution.base++; }}

 

 

迷宫问题代码，稍微优化了一下；问题还是很多的。(小心数组越界).

 

有意见联系：[e-mail]