java栈 迷宫_迷宫求解（数据结构栈应用）

[c++]代码库#include

#include

#include

#include

using namespace std;

#define INIT_SIZE 100 //存储空间初始分配量

#define SIZE_ADD 10 //存储空间分配增量

#define MAXLEN 10 //迷宫大小

struct Coord

{

int r;

int c;

bool operator == (const Coord &b) const

{

return (r==b.r && c==b.c);

}

};

struct Node

{

int ord;

Coord seat;

int di;

};

struct MazeType

{

int r;

int c;

char map[MAXLEN][MAXLEN];

};

int dir[][2]={1,0, -1,0, 0,1, 0,-1};

bool flag;

class Stack

{

public:

Stack ()

{

base = (Node *) malloc(INIT_SIZE * sizeof (Node));

if (!base) exit(0);

to