#include <stdio.h>
#include <stdlib.h>
#define MAX_STACK_SIZE 1000
#define MAX_SIZE 6
typedef struct {
short r;
short c;
}element;
typedef struct {
element stack[MAX_STACK_SIZE];
int top;
}StackType;
void init(StackType *s)
{
s->top = -1;
}
int is_empty(StackType *s)
{
return (s->top == -1);
}
int is_full(StackType *s)
{
return (s->top == (MAX_STACK_SIZE - 1));
}
void push(StackType *s, element item)
{
if (is_full(s)) {
fprintf(stderr, "stack is full\n");
return;
}
else s->stack[++(s->top)] = item;
}
element pop(StackType *s)
{
if (is_empty) {
fprintf(stderr, "stack is empty");
exit(1);
}
else return s->stack[(s->top)--];
}
element peek(StackType *s)
{
if (is_empty) {
fprintf(stderr, "stack is empty");
exit(1);
}
else
return s->stack[s->top];
}
element here = { 1,0 }; //here.r = 1, here.c = 0
element entry = { 1,0 }; //end.r =1 end.c = 0
char maze[MAX_SIZE][MAX_SIZE] = {
{'1', '1', '1', '1', '1', '1'},
{'e', '0', '1', '0', '0', '1'},
{'1', '0', '0', '0', '1', '1'},
{'1', '0', '1', '0', '1', '1'},
{'1', '0', '1', '0', '0', 'x'},
{'1', '1', '1', '1', '1', '1'},
};
void push_loc(StackType *s, int r, int c)
{
if (r < 0 || c < 0) return;
if (maze[r][c] != '1' && maze[r][c] != '.') {
element tmp;
tmp.r = r;
tmp.c = c;
push(s, tmp);
}
}
void main(){
int r, c;
StackType s;
init(&s);
here =entry;
while (maze[here.r][here.c] != 'x') {
r = here.r;
c = here.c;
maze[r][c] = '.';
push_loc(&s, r - 1, c);
push_loc(&s, r + 1, c);
push_loc(&s, r, c - 1);
push_loc(&s, r, c + 1);
if (is_empty(&s)) {
printf("not exit\n");
return;
}
else
here = pop(&s);
}
printf("success");
system("pause");
}