1091. Shortest Path in Binary Matrix

1091. Shortest Path in Binary Matrix

题目传送门

分析

乍一看好像是路径搜索，仔细一看还是路径搜索，实际就是路径搜索。代码实现上我用的是BFS，也可以用DFS，但是我觉得DFS效率上不如BFS，所以就没用。
其中关于路径边缘检测这部分，可以使用在原有矩阵基础上加一圈的操作来避免每次都要判断是否越界的问题。那圈的数值我们可以设置为1。不过我没有采用那种方法，所以代码会有好多IF判断。

代码

class Solution {
public:
    void full_dire(int x, int y, queue<pair<int, int>> &path, vector<vector<int>>& grid){
        if(x > 0 && y > 0 && grid[x - 1][y - 1] == 0){
            grid[x - 1][y - 1] = grid[x][y] + 1;
            path.push({x - 1, y - 1});
        }
        if(y > 0 && grid[x][y - 1] == 0){
            grid[x][y - 1] = grid[x][y] + 1;
            path.push({x, y - 1});
        }
        if(x < grid[0].size() - 1 && y > 0 && grid[x + 1][y - 1] == 0){
            grid[x + 1][y - 1] = grid[x][y] + 1;
            path.push({x + 1, y - 1});
        }
        if(x < grid[0].size() - 1 && grid[x + 1][y] == 0){
            grid[x + 1][y] = grid[x][y] + 1;
            path.push({x + 1, y});
        }
        if(x < grid[0].size() - 1 && y < grid.size() - 1 && grid[x + 1][y + 1] == 0){
            grid[x + 1][y + 1] = grid[x][y] + 1;
            path.push({x + 1, y + 1});
        }
        if(y < grid.size() - 1 && grid[x][y + 1] == 0){
            grid[x][y + 1] = grid[x][y] + 1;
            path.push({x, y + 1});
        }
        if(x > 0 && y < grid.size() - 1 && grid[x - 1][y + 1] == 0){
            grid[x - 1][y + 1] = grid[x][y] + 1;
            path.push({x - 1, y + 1});
        }
        if(x > 0 && grid[x - 1][y] == 0){
            grid[x - 1][y] = grid[x][y] + 1;
            path.push({x - 1, y});
        }
        return;
    }
    int shortestPathBinaryMatrix(vector<vector<int>>& grid) {
        if(grid[0][0] == 1 || grid[grid.size() - 1][grid[0].size() - 1] == 1)
            return -1;
        queue<pair<int, int>> path;
        grid[0][0] = 1;
        path.push({0, 0});
        while(!path.empty()){
            if(path.front().first == grid.size() - 1 && path.front().second == grid[0].size() - 1)
                break;
            full_dire(path.front().first, path.front().second, path, grid);
            path.pop();
        }
        return grid[grid.size() - 1][grid[0].size() - 1] == 0 ? -1 : grid[grid.size() - 1][grid[0].size() - 1];
    }
};