# 【华为OJ】迷宫问题

266人阅读 评论(0)

## 题目

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,


};

Input

Output

Sample Input

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

Sample Output

(0, 0)
(1, 0)
(2, 0)
(2, 1)
(2, 2)
(2, 3)
(2, 4)
(3, 4)
(4, 4)

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

(0,0)
(1,0)
(2,0)
(2,1)
(2,2)
(2,3)
(2,4)
(3,4)
(4,4)

## 广度优先搜索代码

#include<iostream>
#include<queue>
#include<stack>
using namespace std;
struct point{
//横坐标和纵坐标
int x;
int y;
};
int **Maze;  //初始化迷宫
point  **Pre; //保存任意点在路径中的前一步
point move_ori[8] = { { -1, 0 }, { 0, -1 }, { 0, 1 }, { 1, 0 }, { -1, 1 }, { -1, -1 }, { 1, -1 }, {1,1} };
//移动方向，横竖斜都可以，八个方向
void Create(int row, int column){
//创建迷宫，注意到用0表示可走，1表示墙，将整个输入的迷宫再用墙围着，处理的时候不用特别注意边界问题
int i, j;
for (i = 0; i < row + 2; i++)
Maze[i][0] = Maze[i][column + 1] = 1;
for (j = 0; j < column + 2; j++)
Maze[0][j] = Maze[row + 1][j] = 1;
for (i = 1; i <= row; i++){
for (j = 1; j <= column; j++){
cin >> Maze[i][j];
}
}
}

bool MazePath(int row, int column, int x, int y){
//判断是否有路径从入口到出口，保存该路径（队列）
if (x == row && y == column)return true;
queue<point>q;//用于广度优先搜索
point now;
now.x = x;
now.y = y;
q.push(now);
Maze[now.x][now.y] = -1;
while (!q.empty()){
now = q.front();
q.pop();
for (int i = 0; i < 8; i++){
if (now.x + move_ori[i].x == row && now.y + move_ori[i].y == column){
Maze[now.x + move_ori[i].x][now.y + move_ori[i].y] = -1;
Pre[row][column] = now;
return true;
}
if (Maze[now.x + move_ori[i].x][now.y + move_ori[i].y] == 0){
point temp;
temp.x = now.x + move_ori[i].x;
temp.y = now.y + move_ori[i].y;
q.push(temp);
Maze[temp.x][temp.y] = -1;
Pre[temp.x][temp.y] = now;
}
}
}
return false;
}

void PrintPath(int row, int column){
point temp;
stack<point>s;
temp.x = row;
temp.y = column;
while (temp.x != 1 || temp.y != 1){
s.push(temp);
temp = Pre[temp.x][temp.y];
}
cout << "(0,0)" << endl;
while (!s.empty()){
temp = s.top();
cout << '(' << temp.x - 1 << "," << temp.y - 1 << ')' << endl;
s.pop();
}
}

int main(){
int row;//迷宫行数
int column;//迷宫列数
while (~scanf_s("%d%d", &row, &column)){
Maze = new int*[row + 2];
Pre = new point*[row + 2];
for (int i = 0; i < row + 2; i++){
Maze[i] = new int[column + 2];
Pre[i] = new point[column + 2];
}
Create(row, column);
if (MazePath(row, column, 1, 1))
PrintPath(row, column);

}
return 0;
}

0
0

个人资料
• 访问：16453次
• 积分：541
• 等级：
• 排名：千里之外
• 原创：37篇
• 转载：15篇
• 译文：0篇
• 评论：4条
最新评论