迷宫求解__2019.04.05

#include <iostream>
#include <vector>
#include <stack>
#include <list>
using namespace std;

typedef struct Position
{
	int x;
	int y;
	int bianhao;
	bool if_wall;
	bool if_walked;
	bool if_way;
	bool if_right_bianjie = false;
	bool if_down_bianjie = false;
	bool if_left_bianjie = false;
	bool if_up_bianjie = false;
}Position;

int hang, lie;//地图的行列

list<Position>way;

void Init_map(list<Position> &map)
{
	cout << "请输入地图的行和列:";
	cin >> hang >> lie;
	list<int> temp;
	for (int i = 0; i < hang*lie; ++i)
	{
		int tmp;
		cin >> tmp;
		temp.push_back(tmp);
	}
	int bianhao = 0;
	for (int i = 0; i < hang; ++i)
	{
		for (int j = 0; j < lie; ++j)
		{
			Position position;
			position.x = i;
			position.y = j;
			position.bianhao = ++bianhao;
			position.if_walked = false;
			if (temp.front() == 0)
			{
				position.if_wall = false;
			}
			else
			{
				position.if_wall = true;
			}
			position.if_way = false;
			if (position.x == 0)
			{
				position.if_up_bianjie = true;
			}
			if (position.x == hang - 1)
			{
				position.if_down_bianjie = true;
			}
			if (position.y == 0)
			{
				position.if_left_bianjie = true;
			}
			if (position.y == lie - 1)
			{
				position.if_right_bianjie = true;
			}
			map.push_back(position);
			temp.pop_front();
		}
	}
}

/*
如果可以向该方向走，返回0
如果因为是边界而不能向该方向走的话，返回1
如果不是边界，却因为是墙，不能向该方向走的话，返回2
*/

int if_walk_right(list<Position>::iterator &it)//判断当前位置是否可以向右走
{
	if (it->if_right_bianjie == true)//因为边界
	{
		return 1;
	}
	else//如果不是边界
	{
		++it;
		if (it->if_wall == false && it->if_walked == false)//它不是墙，并且没有走过
		{
			return 0;
		}
		else//不是边界，却因为是墙
		{
			return 2;
		}
	}
}

int if_walk_down(list<Position>::iterator &it)//判断当前位置是否可以向下走
{
	if (it->if_down_bianjie == true)
	{
		return 1;
	}
	else //如果不是下边界
	{
		for (int i = 0; i < lie; ++i)
		{
			++it;
		}
		if (it->if_wall == false && it->if_walked == false)
		{
			return 0;
		}
		else
		{
			return 2;
		}
	}
}

int if_walk_left(list<Position>::iterator &it)//判断当前位置是否可以向左走
{
	if (it->if_left_bianjie == true)
	{
		return 1;
	}
	else//如果不是左边界
	{
		--it;
		if (it->if_wall == false && it->if_walked == false)
		{
			return 0;
		}
		else
		{
			return 2;
		}
	}
}

int if_walk_up(list<Position>::iterator &it)//判断当前位置是否可以向上走
{
	if (it->if_up_bianjie == true)
	{
		return 1;
	}
	else//如果不是左边界
	{
		for (int i = 0; i < lie; ++i)
		{
			--it;
		}
		if (it->if_wall == false && it->if_walked == false)
		{
			return 0;
		}
		else
		{
			return 2;
		}
	}
}

void walk_right(list<Position>::iterator &it)
{
	int res = if_walk_right(it);
	if (res == 0)//可以向右走
	{
		it->if_way = true;
		it->if_walked = true;
		way.push_front(*it);
		walk_right(it);
	}
	if (res == 1)//因为是边界不能向右走
	{
		return;
	}
	if (res == 2)//不是边界，却因为是墙，不能向该方向走
	{
		--it;
		return;
	}
}

void walk_down(list<Position>::iterator &it)
{
	int res = if_walk_down(it);
	if (res == 0)
	{
		it->if_way = true;
		it->if_walked = true;
		way.push_front(*it);
		walk_down(it);
	}
	if (res == 1)//因为是边界不能向右走
	{
		return;
	}
	if (res == 2)//不是边界，却因为是墙，不能向该方向走
	{
		for (int i = 0; i < lie; ++i)//如果不能向下走则退回原点
		{
			--it;
		}
		return;
	}
}

void walk_left(list<Position>::iterator &it)
{
	int res = if_walk_left(it);
	if (res == 0)
	{
		it->if_way = true;
		it->if_walked = true;
		way.push_front(*it);
		walk_left(it);
	}
	if (res == 1)//因为是边界不能向右走
	{
		return;
	}
	if (res == 2)//不是边界，却因为是墙，不能向该方向走
	{
		++it;
		return;
	}
}

void walk_up(list<Position>::iterator &it)
{
	int res = if_walk_up(it);
	if (res == 0)
	{
		it->if_way = true;
		it->if_walked = true;
		way.push_front(*it);
		walk_up(it);
	}
	if (res == 1)//因为是边界不能向右走
	{
		return;
	}
	if (res == 2)//不是边界，却因为是墙，不能向该方向走
	{
		for (int i = 0; i < lie; ++i)//如果不能向下走则退回原点
		{
			++it;
		}
		return;
	}
}

int if_silu(list<Position>::iterator &it)
{
	int silu = 0;//死路
	int res = -1;
	int bianjie = 0;
	int qiang = 0;
	res = if_walk_down(it);
	if (res == 0)
	{
		for (int i = 0; i < lie; ++i)
		{
			--it;
		}
	}
	if (res == 2)//因为墙
	{
		for (int i = 0; i < lie; ++i)
		{
			--it;
		}
		qiang = 1;
	}
	if (res == 1)//因为边界
	{
		bianjie = 1;
	}
	if (qiang == 1 || bianjie == 1)
	{
		++silu;
	}


	qiang = 0;
	bianjie = 0;
	res = if_walk_left(it);
	if (res == 0)//如果不能向左走
	{
		++it;
	}
	if (res == 2)//因为墙
	{
		++it;
		qiang = 1;
	}
	if (res == 1)
	{
		bianjie = 1;
	}
	if (qiang == 1 || bianjie == 1)
	{
		++silu;
	}


	qiang = 0;
	bianjie = 0;
	res = if_walk_right(it);
	if (res == 0)//如果不能向右走
	{
		--it;
	}
	if (res == 2)
	{
		--it;
		qiang = 1;
	}
	if (res == 1)
	{
		bianjie = 1;
	}
	if (qiang == 1 || bianjie == 1)
	{
		++silu;
	}

	qiang = 0;
	bianjie = 0;
	res = if_walk_up(it);
	if (res == 0)//如果能向上走
	{
		for (int i = 0; i < lie; ++i)
		{
			++it;
		}
	}
	if (res == 2)
	{
		for (int i = 0; i < lie; ++i)
		{
			++it;
		}
		qiang = 1;
	}
	if (res == 1)
	{
		bianjie = 1;
	}
	if (qiang == 1 || bianjie == 1)
	{
		++silu;
	}
	return silu;
}

//stack<Position>way;
void fun(list<Position> &map)
{
	list<Position>::iterator it = map.begin();
	it->if_way = true;
	it->if_walked = true;
	way.push_front(*it);
	while (1)
	{
		int silu = if_silu(it);
		if (silu == 4)//说明三个方向都不能走，为真正的死路
		{
			it->if_way = false;
			list<Position>::iterator it_way = way.begin();
			it_way->if_way = false;
			way.pop_front();
			it_way = way.begin();
			int bianhao = it_way->bianhao;

			list<Position>::iterator it_temp = map.begin();
			for (int i = 0; i < bianhao - 1; ++i)
			{
				++it_temp;
			}
			it = it_temp;
		}

		if (it->x == hang - 1 && it->y == lie - 1) break;
		walk_up(it);//向左走
		if (it->x == hang - 1 && it->y == lie - 1) break;
		walk_right(it);//向右走
		if (it->x == hang - 1 && it->y == lie - 1) break;
		walk_down(it);//向下走
		if (it->x == hang - 1 && it->y == lie - 1) break;
		walk_left(it);//向左走
		if (it->x == hang - 1 && it->y == lie - 1) break;
	}
}

void show_map(list<Position> map)
{
	cout << "迷宫地图为：" << endl;
	list<Position>::iterator it = map.begin();
	for (int i = 0; i < hang; ++i)
	{
		for (int j = 0; j< lie; ++j)
		{
			if (it->if_way == true)
			{
				cout << "*" << " ";
			}
			else
			{
				if (it->if_wall == true)
				{
					cout << "1" << " ";
				}
				if (it->if_wall == false)
				{
					cout << "0" << " ";
				}
			}
			++it;
		}
		cout << endl;
	}
}

int main()
{
	list<Position> map;
	Init_map(map);
	show_map(map);
	fun(map);
	show_map(map);
	return 0;
}