递归实现迷宫求解

0  0    1    0    0    0    0    0    0    0
0  0    1    1    1    1    0    0    0    0
0  0    0    0    0    1    0    0    0    0
0  0    0    0    0    1    1    0    0    0
0  0    0    0    0    0    1    0    0    0
0  0    0    0    0    0    1    0    0    0
0  0    0    0    0    0    1    0    0    0
0  0    0    0    0    0    1    0    0    0
0  0    0    0    0    0    1    1    1    0
0  0    0    0    0    0    0    0    1    0

#pragma once

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<assert.h>

#define MAX_WID 10
#define MAX_LEN 10
#define FILENAME "maze.txt"

int Getseat(FILE*stream);

struct seat
{
int x;
int y;
};

class  maze
{
public:
seat entry;
maze();
~maze();
void Init();
void printmaze();
//bool PathMaze(seat entry);
bool pathMaze(seat entry);
bool IsPass(seat entry);

private:
int _maze[MAX_WID][MAX_LEN];
};

#include"maze.h"

FILE* fp = fopen(FILENAME, "r");
int tmp[MAX_WID][MAX_LEN] = { 0 };

maze::maze()
{
Init();
entry.x = 9;
entry.y = 8;

for (int i = 0; i < MAX_LEN; i++)
{
for (int j = 0; j < MAX_WID; j++)
{
tmp[i][j] = _maze[i][j];
}
}
}

int Getseat(FILE*stream)
{
assert(stream);
while (1)
{
int c = getc(stream);
if ((c != ' ') && (c != '\n') && (c != EOF))
return c-'0';
}
}

void maze::Init()
{
if (fp == NULL)
{
perror(FILENAME);
exit(EXIT_FAILURE);
}
for (int i = 0; i < MAX_LEN;i++)
{
for (int j = 0; j < MAX_WID; j++)
{
_maze[i][j] = Getseat(fp);
}
}
}

void maze::printmaze()
{
for (int i = 0; i < MAX_LEN; i++)
{
for (int j = 0; j < MAX_WID; j++)
{
std::cout <<"  "<<tmp[i][j];
}
std::cout << '\n';
}
}

bool maze::IsPass(seat entry)
{
if (tmp[entry.x][entry.y] == 1)
return true;
return false;
}

//先进去再判断的解法
bool maze::pathMaze(seat entry)
{
if (entry.x < 0 || entry.y < 0 || entry.y == MAX_WID)
{
std::cout << "ok" << std::endl;
return true;

}

if (IsPass(entry))
{
tmp[entry.x][entry.y] = 2;

// 超前
seat newEntry1(entry);
newEntry1.x -= 1;
if (pathMaze(newEntry1))
{
return true;
}

seat newEntry2(entry);
newEntry2.y -= 1;

if (pathMaze(newEntry2))
{
return true;
}
seat newEntry3(entry);
newEntry3.y += 1;

if (pathMaze(newEntry3))
{
return true;
}
tmp[entry.x][entry.y] = 3;

}
return false;
}

maze::~maze()
{
fclose(fp);
}

#include"maze.h"

int main()
{
maze m1;
m1.printmaze();
int c=m1.pathMaze(m1.entry);
m1.printmaze();

system("pause");
return 0;
}