Problem #23 [Easy]

This problem was asked by Google.

You are given an M by N matrix consisting of booleans that represents a board. Each True boolean represents a wall. Each False boolean represents a tile you can walk on.

Given this matrix, a start coordinate, and an end coordinate, return the minimum number of steps required to reach the end coordinate from the start. If there is no possible path, then return null. You can move up, left, down, and right. You cannot move through walls. You cannot wrap around the edges of the board.

For example, given the following board:

[[f, f, f, f],
[t, t, f, t],
[f, f, f, f],
[f, f, f, f]]
and start = (3, 0) (bottom left) and end = (0, 0) (top left), the minimum number of steps required to reach the end is 7, since we would need to go through (1, 2) because there is a wall everywhere else on the second row.
求最短路径，bfs即可。

int updateMatrix(vector<vector<char>>& arr) {
        int stp = 1, m = arr.size(), n = arr[0].size(),x,y;
        queue<pair<int,int>> que;
        int start[2] ={3,0}, end[2] ={0,0};
        int directions[4][2] ={{0,1}, {0,-1},{1,0},{-1,0} };
        que.push({start[0], start[1]});
        while(!que.empty()){
            int sz = que.size();
            for(int i=0;i<sz;i++){
                auto cur = que.front();
                que.pop();
                for(auto dir:directions){
                    x = cur.first+dir[0];
                    y = cur.second+dir[1];
                    if( x<0 || x >= m || y<0 ||y>=n || arr[x][y] == 't') continue;
                    if(x== end[0] and y == end[1]) {return stp;}
                    que.push({x,y});
                    arr[x][y] = 1;
                }   
            }
            stp++;
        }
        return 0;
    }