迷宫问题——栈

 

 

 

 

     这是我写的迷宫问题代码，虽然有一个逻辑错误，毕竟我知道错误在那里；虽然和一般的迷宫代码相比，我写的特别复杂；虽然我为此花费了大量的时间和精力，但这已足够。

     其实，迷宫问题也许很简单。但无论如何，在我得到我想得到的结果时的那一刻，我突然有了一种想哭的冲动……

     我知道，在通向工程师的道路上会有许多的困难，但我一直没有放弃，我在为目标努力着。

 

 

代码：

    ///dabbysunshine@qq.com ///============================================================================= #include <stdio.h> #include <stdlib.h> #include <string.h> #define STACK_INIT_SIZE 100 #define STACKINCREMENT 10 #define W 80 //迷宫宽的最大值 #define H 60 //迷宫高的最大值 typedef struct { int x,y; } Way; typedef struct { Way *base; Way *top; int stacksize; } MazeStack; void CreateMaze(int co_ordinate[][W],int w,int h);///初始化迷宫 void OutputMaze(int co_ordinate[][W],int w,int h);///输出迷宫 void InitStack(MazeStack &MazeSolution); ///初始化栈 void Push(MazeStack &MazeSolution,Way Position); ///插入新元素为栈顶 bool PDuan_Top(MazeStack MazeSolution,Way exit); ///栈顶元素与出口进行比较 bool GetTop(MazeStack MazeSolution,Way &Position);///得到栈顶元素 void Pop(MazeStack &MazeSolution,Way &Temp); ///删除栈顶元素 void MazePath(int co_ordinate[][W],Way Entry,Way Exit,int w,int h); void DisplayMazePath(MazeStack MazeSolution); ///输出迷宫路径 ///============================================================================= ///主函数部分 int main(void) { int w,h; ///设置迷宫的宽和高 int co_ordinate[H][W]; Way Entry,Exit; ///设置迷宫的出入口 scanf("%d%d",&h,&w); CreateMaze(co_ordinate,w,h); ///创造迷宫 puts("/n输出迷宫:"); OutputMaze(co_ordinate,w,h); ///输出迷宫的样式 puts("入口:"); scanf("%d%d",&Entry.x,&Entry.y); puts("出口:"); scanf("%d%d",&Exit.x,&Exit.y); MazePath(co_ordinate,Entry,Exit,w,h);///寻找逃出迷宫的路径 printf("/nNevr Give Up~!/n相信自己，因为你是最棒的./n"); return 0; } ///============================================================================= ///自定义函数部分 void CreateMaze(int co_ordinate[][W],int w,int h) { int i,j; for(i = 0; i < h; i++) { for(j = 0; j < w; j++) { scanf("%d",&co_ordinate[i][j]); } } } void OutputMaze(int co_ordinate[][W],int w,int h) { int i,j; for(i = 0; i < h; i++) { for(j = 0; j + 1 < w; j++) { printf("%d ",co_ordinate[i][j]); } printf("%d/n",co_ordinate[i][j]); } } void InitStack(MazeStack &MazeSolution) { MazeSolution.base = (Way*)malloc(STACK_INIT_SIZE*sizeof(Way)); if(!MazeSolution.base) { puts("内存分配错误."); exit(0); } MazeSolution.top = MazeSolution.base; MazeSolution.stacksize = STACK_INIT_SIZE; } void Push(MazeStack &MazeSolution,Way Position) { if(MazeSolution.top - MazeSolution.base >= MazeSolution.stacksize) { MazeSolution.base = (Way*)realloc(MazeSolution.base, (MazeSolution.stacksize + STACKINCREMENT)*sizeof(Way)); if(!MazeSolution.base) { puts("内存分配失败."); exit(0); } MazeSolution.top = MazeSolution.base + MazeSolution.stacksize; MazeSolution.stacksize += STACKINCREMENT; } MazeSolution.top->x = Position.x; MazeSolution.top->y = Position.y; MazeSolution.top++; } bool GetTop(MazeStack MazeSolution,Way &Position) { if(MazeSolution.base == MazeSolution.top) { puts("栈为空."); return false; } else { Position = *(MazeSolution.top - 1); return true; } } void Pop(MazeStack &MazeSolution,Way &Temp) { if(MazeSolution.top == MazeSolution.base) { puts("栈为空."); } else { MazeSolution.top--; Temp = *(MazeSolution.top); } } bool PDuan_Top(MazeStack MazeSolution,Way Exit) { if(MazeSolution.base == MazeSolution.top) { puts("空栈."); return false; } MazeSolution.top--; if((MazeSolution.top->x == Exit.x) && (MazeSolution.top->y == Exit.y)) { return true; } else { return false; } } void DisplayMazePath(MazeStack MazeSolution) { if(MazeSolution.base == MazeSolution.top) { puts("出口与入口相同."); exit(0); } while(MazeSolution.base != MazeSolution.top) { printf("(%d,%d)/n",MazeSolution.base->x,MazeSolution.base->y); MazeSolution.base++; } } void MazePath(int co_ordinate[][W],Way Entry,Way Exit,int w,int h) { MazeStack MazeSolution; InitStack(MazeSolution); Way Temp_1 = Entry,Temp_2 = Temp_1; Push(MazeSolution,Entry); ///入口进栈 while(!PDuan_Top(MazeSolution,Exit)) ///能够走出迷宫 { if(MazeSolution.base == MazeSolution.top) ///没有出路时的情况 { puts("死迷宫，无出路."); exit(0); } if((co_ordinate[Temp_1.y - 1][Temp_1.x] == 0) && (Temp_1.y <= h && Temp_1.x + 1 <= w)) ///可以通过 { co_ordinate[Temp_1.y - 1][Temp_1.x] = 1; Temp_1.x = Temp_1.x + 1; ///东边的情况 Temp_2 = Temp_1; Push(MazeSolution,Temp_2); } else if((co_ordinate[Temp_1.y][Temp_1.x - 1] == 0) && (Temp_1.y + 1 <= h && Temp_1.x <= w)) { co_ordinate[Temp_1.y][Temp_1.x - 1] = 1; Temp_1.y = Temp_1.y + 1; ///南边的情况 Temp_2 = Temp_1; Push(MazeSolution,Temp_2); } else if((co_ordinate[Temp_1.y - 1][Temp_1.x - 2] == 0) && (Temp_1.y <= h && Temp_1.x - 1 <= w)) { co_ordinate[Temp_1.y - 1][Temp_1.x - 2] = 1; Temp_1.x = Temp_1.x - 1; ///西边的情况 Temp_2 = Temp_1; Push(MazeSolution,Temp_2); } else if((co_ordinate[Temp_1.y - 2][Temp_1.x - 1] == 0) && (Temp_1.y - 1 <= h && Temp_1.x <= w)) { co_ordinate[Temp_1.y - 2][Temp_1.x - 1] = 1; Temp_1.y = Temp_1.y - 1; ///北边的情况 Temp_2 = Temp_1; Push(MazeSolution,Temp_2); } else { Pop(MazeSolution,Temp_1); } } puts("/n逃出迷宫的路径是:"); DisplayMazePath(MazeSolution); }

 

 

图例：

迷宫问题(无出路).

  

     

 

 

有出路: