题意:
int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, };
它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。并输出沿途经过的点的坐标。
#include <queue>
#include <iostream>
using namespace std;
int maze[7][7], pre[30], vis[30];
int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
bool isLeagal ( int r, int c )
{
if ( r < 0 || c < 0 || r > 4 || c > 4 )
return false;
if ( maze[r][c] == 1 )
return false;
return true;
}
void print ( int des )
{
if ( pre[des] != -1 )
print ( pre[des] );
cout << '(' << des / 5 << ", " << des % 5 << ')' << endl;
}
void bfs ()
{
queue<int> que;
memset(vis,0,sizeof(vis));
pre[0] = -1;
vis[0] = true;
que.push ( 0 );
int now, next;
int r, c, tr, tc;
while ( ! que.empty () )
{
now = que.front();
que.pop();
r = now / 5;
c = now % 5;
for ( int i = 0; i < 4; i++ )
{
tr = r + dir[i][0];
tc = c + dir[i][1];
next = tr * 5 + tc;
if ( isLeagal ( tr, tc ) && !vis[next] )
{
pre[next] = now;
if ( next == 24 ) return;
vis[next] = true;
que.push(next);
}
}
}
}
int main()
{
for ( int i = 0; i < 5; i++ )
for ( int j = 0; j < 5; j++ )
cin >> maze[i][j];
bfs();
print(24);
return 0;
}