dfs迷宫问题（最短路径）

迷宫问题_牛客题霸_牛客网

 思路：

#include
#include
using namespace std;
int ROW, COL;
vector> maze;
vector> path_tmp; //临时路劲
vector> path_best; //最佳路劲
void MazeTrack(int i, int j) {maze[i][j] = 1; //代表（i,j）已经走过path_tmp.push_back({i, j});
//判断是否到达出口if (i == ROW - 1 && j == COL - 1) {
//寻找最短路劲if (path_best.empty() || path_best.size() > path_tmp.size())path_best = path_tmp;}
//向右走if (j + 1 < COL && maze[i][j + 1] == 0)MazeTrack(i, j + 1);
//向左走if (j - 1 >= 0 && maze[i][j - 1] == 0)MazeTrack(i, j - 1);
//向上走if (i - 1 >= 0 && maze[i - 1][j] == 0)MazeTrack(i - 1, j);
//向下走if (i + 1 < ROW && maze[i + 1][j] == 0)MazeTrack(i + 1, j);maze[i][j] = 0; //走不通，回溯 恢复路径path_tmp.pop_back();
}
int main() {cin >> ROW >> COL;maze = vector>(ROW, vector(COL, 0)); //开辟迷宫空间//首先输入迷宫for (int i = 0; i < ROW; ++i) {for (int j = 0; j < COL; ++j)cin >> maze[i][j];}MazeTrack(0, 0); //从起始点（0，0）开始走
//输出路径for (int i = 0; i < path_best.size(); ++i) {cout << "(" << path_best[i][0] << "," << path_best[i][1] << ")" << endl;}return 0;
}

用pair对组优化

#include
using namespace std;int dirs[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};
int n, m, grid[10][10];
vector> bestPath, path;void dfs(int x, int y) {grid[x][y] = 1;path.emplace_back(x, y);if (x == n - 1 && y == m - 1)   // 到达终点if (bestPath.empty() || path.size() < bestPath.size()) {bestPath = path;return;}for (auto &[dx, dy] : dirs) {int nx = x + dx, ny = y + dy;if (nx < 0 || nx >= n || ny < 0 || ny >= m || grid[nx][ny]) continue;dfs(nx, ny);}path.pop_back();    // 还原状态grid[x][y] = 0;
}int main() {cin >> n >> m;for (int i = 0; i < n; ++i)for (int j = 0; j < m; ++j)cin >> grid[i][j];dfs(0, 0);for (auto &[x, y] : bestPath) {printf("(%d,%d)\n", x, y);}return 0;
}