定义一个二维数组:
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表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。
Input
一个5 × 5的二维数组,表示一个迷宫。数据保证有唯一解。
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)
思路:BFS || DFS应该都行,用并查集记录下路径即可。我建了图+spfa+并查集过的;
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 10;
int a[MAXN][MAXN], pre[MAXN * MAXN];
vector<int> G[MAXN * MAXN];
int vis[MAXN * MAXN], dis[MAXN * MAXN];
struct node {
int x;
int y;
}s[MAXN * MAXN];
void solve() {
memset(vis, 0, sizeof(vis));
for(int i = 0; i < MAXN * MAXN; ++i) dis[i] = INF;
queue<int> que;
que.push(0);
dis[0] = 0;
vis[0] = 1;
while(!que.empty()) {
int u = que.front();
que.pop();
for(int i = 0; i < G[u].size(); ++i) {
int v = G[u][i];
if(dis[v] > dis[u] + 1) {
dis[v] = dis[u] + 1;
pre[v] = u;
if(vis[v]) continue;
vis[v] = 1;
que.push(v);
}
}
}
int x = 24, p = 0;
while(x != 0) {
s[p].x = x / 5;
s[p++].y = (x % 5);
x = pre[x];
}
printf("(0, 0)\n");
for(int i = p - 1; i >= 0; --i) {
printf("(%d, %d)\n", s[i].x, s[i].y);
}
}
int main() {
for(int i = 0; i < MAXN; ++i) {
for(int j = 0; j < MAXN; ++j) {
a[i][j] = 1;
}
}
for(int i = 0; i < 5; ++i) {
for(int j = 0; j < 5; ++j) {
scanf("%d", &a[i][j]);
if(a[i][j] == 1) continue;
if(!a[i - 1][j] && i - 1 >= 0) {
int u = i * 5 + j;
int v = (i - 1) * 5 + j;
G[u].push_back(v);
G[v].push_back(u);
//printf("(%d %d) -> (%d %d)\n", i, j, i - 1, j);
}
if(!a[i][j - 1] && j - 1 >= 0) {
int u = i * 5 + j;
int v = i * 5 + j - 1;
G[u].push_back(v);
G[v].push_back(u);
//printf("(%d %d) -> (%d %d)\n", i, j, i, j - 1);
}
}
}
solve();
return 0;
}