迷宫.cpp

G:投资问题（浮点型投资）.G:投资问题（浮点型投资）.G:投资问题（浮点型投资）.

#include<iostream>
using namespace std;
int maze[10][10]={{1,1,1,1,1,1,1,1,1,1},{1,0,0,0,0,0,0,0,0,1},{1,0,1,1,1,1,0,1,0,1},{1,0,0,0,0,1,0,1,0,1},{1,0,1,0,0,0,0,1,0,1},{1,0,1,0,1,1,0,1,0,1},{1,0,1,0,0,0,0,1,1,1},{1,0,1,0,0,1,0,0,0,1},{1,0,1,1,1,1,1,1,0,1},{1,1,1,1,1,1,1,1,1,1}};
int fx[4]={1,-1,0,0};
int fy[4]={0,0,-1,1};
struct queue
{
	int x, y, pre;
}sq[120];
int qh=0, qe=0, i=0, j=0, k=0;
void search();
int  check();
void out();

void main()
{
	search();

}

void search()
{
	int flag=0;

	qh=0;
	qe=1;
	maze[1][1]=-1;

	sq[1].pre=0;
	sq[1].x=1;
	sq[1].y=1;

	while(qh!=qe)
	{
		qh=qh+1;
		for(k=0;k<=3;k++)
		{
			i=sq[qh].x+fx[k];
			j=sq[qh].y+fy[k];

			if(check()==1)
			{
				flag=1;
				qe=qe+1;
				sq[qe].x=i;
				sq[qe].y=j;
				sq[qe].pre=qh;
				maze[i][j]=-1;

				if(sq[qe].x==8 && sq[qe].y==8)
				{
					out();
					return;
				}
			}
		}
		if(flag==0)
		{
			cout<<"No avaliable way!"<<endl;
		}
	}
}

int check()
{
	if(maze[i][j]==1||maze[i][j]==-1)
		return 0;
	else
		return 1;
}
void out()
{
	cout<<"("<<sq[qe].x<<","<<sq[qe].y<<")"<<endl;
	while(sq[qe].pre!=0)
	{
		qe=sq[qe].pre;
		cout<<"("<<sq[qe].x<<","<<sq[qe].y<<")"<<endl;	
	}
}