迷宫
一、【问题描述】
下图给出了一个迷宫的平面图，其中标记为 1 的为障碍，标记为 0 的为可以通行的地方。
010000
000100
001001
110000
AHHA
01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000
迷宫的入口为左上角，出口为右下角，在迷宫中，只能从一个位置走到这个它的上、下、左、右四个方向之一。
对于上面的迷宫，从入口开始，可以按DRRURRDDDR 的顺序通过迷宫，一共 10 步。其中 D、U、L、R 分别表示向下、向上、向左、向右走。对于下面这个更复杂的迷宫（30 行 50 列） ，请找出一种通过迷宫的方式，其使用的步数最少，在步数最少的前提下，请找出字典序最小的一个作为答案。请注意在字典序中D<L<R<U。（如果你把以下文字复制到文本文件中，请务必检查复制的内容是否与文档中的一致。在试题目录下有一个文件 maze.txt，内容与下面的文本相同）
明天再用别的方法写。
解法一
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1e3+5;
char mp[maxn][maxn];
int vis[maxn][maxn];
char ch[4] = {'D','L','R','U'};
int d[4][2]={1,0,0,-1,0,1,-1,0};
int n=30,m=50;
struct node
{
int x;
int y;
string s;
};
queue<node>q;
int check(int x , int y){
if(x < 0 || x >= n || y < 0 || y >= m || vis[x][y] == 1 || mp[x][y] == '1')
return 0;
return 1;
}
int bfs(int x,int y)
{
vis[x][y] = 1;
struct node team; //临时变量node
team.x=x;
team.y=y;
team.s="";
q.push(team);
while(!q.empty())
{
team = q.front();
if( team.x == n-1 && team.y == m-1){
cout<<team.s;
}
q.pop();
int X=team.x;
int Y=team.y;
for(int i = 0 ; i < 4 ;i ++ ){
int dx = X + d[i][0];
int dy = Y + d[i][1];
if(check(dx , dy))
{
vis[dx][dy] = 1;
team.x=dx;
team.y=dy;
team.s=team.s+ch[i];
q.push(team);
team.s=team.s.substr(0,team.s.length()-1); //这一组的四个方向如果要进的话，需要删除上一次进来的
}
}
}
}
int main()
{
for(int i=0 ;i <n ;i ++ )
{
for( int j=0 ; j< m ;j++)
{
cin>>mp[i][j];
}
}
bfs(0,0);
return 0;
}
因为字符串，刚开始一直是弄的1，导致不是字符，加上'1'才对的。在check函数中。
解法二
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1e3+5;
char mp[maxn][maxn];
int vis[maxn][maxn];
char ch[4] = {'D','L','R','U'};
int d[4][2]={1,0,0,-1,0,1,-1,0};
int n=30,m=50;
struct node
{
int x;
int y;
string s;
node(int xx,int yy ,string ss){
x=xx;
y=yy;
s=ss;
}
};
queue<node>q;
int check(int x , int y){
if(x < 0 || x >= n || y < 0 || y >= m || vis[x][y] == 1 || mp[x][y] == '1')//是字符不是整型
return 0;
return 1;
}
int bfs(int x,int y)
{
vis[x][y] = 1;
// struct node team=q.front(); //临时变量node
// team.x=x;
// team.y=y;
// team.s="";
q.push(node(x,y,""));
// 最简单入队列方法q.push({x,y,""});
while(!q.empty())
{
node team = q.front();
if( team.x == n-1 && team.y == m-1){
cout<<team.s;
cout<<team.s.length();
}
q.pop();
int X=team.x;
int Y=team.y;
for(int i = 0 ; i < 4 ;i ++ ){
int dx = X + d[i][0];
int dy = Y + d[i][1];
if(check(dx , dy))
{
vis[dx][dy] = 1;
// team.x=dx;
// team.y=dy;
// team.s=team.s+ch[i]; //team加上一个新的字符路径
q.push(node(dx,dy,team.s+ch[i]));
//team.s=team.s.substr(0,team.s.length()-1);
// q.push({x,y,""}); 最简便入队列方法
}
}
}
}
int main()
{
for(int i=0 ;i <n ;i ++ )
{
for( int j=0 ; j< m ;j++)
{
cin>>mp[i][j];
}
}
bfs(0,0);
return 0;
}