#include "iostream"
#include "malloc.h"
#define TRUE 1;
#define FALSE 0;
#define INIT_STACK_SIZE 20
#define INCREATE_STACK_SIZE 10
typedef int Status;
using namespace std;//位子坐标
struct Position
{int x;int y;
};typedef struct
{Position pos;int di;
}SElemType;typedef struct
{SElemType * base;SElemType * top;int sizeStack;
}MazeStack;Position BeginPos;
Position EndPos;
int w, h;;Status InitStack(MazeStack & maze)
{maze.base = (SElemType *)malloc(sizeof(SElemType) * INIT_STACK_SIZE);if (maze.base == NULL)return FALSE;maze.top = maze.base;maze.sizeStack = INIT_STACK_SIZE;return TRUE;
}Status IsEmpty(MazeStack & maze)
{if (maze.base == maze.top)return TRUE;return FALSE;
}Status Push(MazeStack & maze, SElemType & ele)
{if (maze.base - maze.top >= maze.sizeStack){maze.base = (SElemType *)realloc(maze.base, sizeof(SElemType) * (INCREATE_STACK_SIZE + maze.sizeStack));if (maze.base == NULL)return FALSE;maze.top = maze.base + maze.sizeStack;maze.sizeStack = maze.sizeStack = INCREATE_STACK_SIZE;}*maze.top = ele;maze.top++;return TRUE;
}Status Pop(MazeStack & maze, SElemType & ele)
{if (maze.base == maze.top)return FALSE;ele = *(--maze.top);return TRUE;
}Status GetTail(MazeStack & maze, SElemType & ele)
{if (IsEmpty(maze))return FALSE;ele = *(maze.top - 1);return TRUE;
}//判断是否是墙
Status Pass(int **a, Position & pos)
{if (a[pos.x][pos.y] == 0)return FALSE;return TRUE;
}//走过的话，标记为2
void FootPrint(int ** a, Position & pos)
{a[pos.x][pos.y] = 2;
}//设置为墙
void MarkPrint(int ** a, Position & pos)
{a[pos.x][pos.y] = 0;
}//判断是否走过
SElemType  NextPos(int **a, SElemType & ele)
{switch (ele.di){//向东寻找case 1:ele.pos.x++;if (a[ele.pos.x][ele.pos.y] != 2)break;ele.pos.x--;//继续寻找下去//向南寻找case 2:ele.pos.y++;if (a[ele.pos.x][ele.pos.y] != 2)break;//继续寻找下去ele.pos.x--;//向西寻找case 3:ele.pos.x--;if (a[ele.pos.x][ele.pos.y] != 2)break;ele.pos.x++;//最后一个方向，如果走过的话，那么必然是死路，那么就将其变成墙case 4:ele.pos.y--;if (a[ele.pos.x][ele.pos.y] == 2){MarkPrint(a, ele.pos);//设为墙ele.pos.y++;}break;}return ele;
}Status CreateMaze(int ** & a)//如果不传引用的话，就应该传*** a
{int temp;cout << "请输入迷宫的长，宽: ";cin >> w;cin >> h;cout << "请输入迷宫: " << endl;a = (int **)malloc(sizeof(int *) * h);if (a == NULL){cout << "创建迷宫失败!" << endl;return FALSE;}for (int i = 0; i < h; i++){a[i] = (int *)malloc(sizeof(int) * w);if (a[i] == NULL){cout << "创建迷宫失败!" << endl;return FALSE;}for (int j = 0; j < w; j++){scanf_s("%d", &temp);a[i][j] = temp;}}cout << "请输入入口:" << endl;cin >> BeginPos.x;cin >> BeginPos.y;cout << "请输入出口:" << endl;cin >> EndPos.x;cin >> EndPos.y;cout << "迷宫创建成功!" << endl;for (int i = 0; i < h; i++){for (int j = 0; j < w; j++)cout << a[i][j] << " ";cout << endl;}
}void DistroyMaze(int ** &a)
{for (int i = 0; i < h; i++)delete a[i];delete a;
}void MazePath(int ** a, MazeStack & mazeStack)
{SElemType ele;ele.pos.x = BeginPos.x;ele.pos.y = BeginPos.y;ele.di = 1;do{if (Pass(a, ele.pos)) //如果不是墙{ele.di = 1;//如果不是墙的话， 就默认寻找东方Push(mazeStack, ele); //压栈FootPrint(a, ele.pos);//标记走过if (ele.pos.x == EndPos.x && ele.pos.y == EndPos.y) //如果是出口，不再循环break;ele = NextPos(a, ele); //寻找东方是否走过}else //如果是墙{if (!IsEmpty(mazeStack)){Pop(mazeStack, ele);//返回上一步while (ele.di == 4 && !IsEmpty(mazeStack)) //如果回路上有好几个格子的四周都是探索过的那么，都在迷宫中这些格子置为墙壁{MarkPrint(a, mazeStack.top->pos);Pop(mazeStack, ele);}if (ele.di < 4){ele.di++;Push(mazeStack, ele); //如果四个方向没有检查完，把刚出栈的重新入栈ele = NextPos(a, ele);}}}if (ele.di == 4 && IsEmpty(mazeStack)){cout << "该迷宫没有出路!" << endl;break;}} while (true);
}//输出倒着了
void ShowMaze(int ** & a, MazeStack & mazeStack)
{SElemType ele;while(!IsEmpty(mazeStack)){Pop(mazeStack, ele);cout << "( " << ele.pos.x << "," << ele.pos.y << " )  ";}
}int main()
{MazeStack mazeStack;InitStack(mazeStack);int ** a = NULL;CreateMaze(a);cout << "---------------------------------" << endl;MazePath(a, mazeStack);ShowMaze(a, mazeStack);DistroyMaze(a);system("pause");return 0;
}
/*
测试数据：
1 1
3 3
0 0 0 0 0
0 1 1 1 0
0 1 0 0 0
0 1 1 1 0
0 0 0 0 0*/