力扣529扫雷游戏 DFS

1、dfs递归8个方向

三种情况

1、如果一个地雷（'M'）被挖出，游戏就结束了- 把它改为 'X'。
2、如果一个没有相邻地雷的空方块（'E'）被挖出，修改它为（'B'），并且所有和其相邻的未挖出方块都应该被递归地揭露。
3、如果一个至少与一个地雷相邻的空方块（'E'）被挖出，修改它为数字（'1'到'8'），表示相邻地雷的数量。
如果在此次点击中，若无更多方块可被揭露，则返回面板。

class Solution {
public:
    vector<vector<char>> updateBoard(vector<vector<char>>& board, vector<int>& click) {
        int row = click[0];
        int line = click[1];
        if(board[row][line] == 'M')//炸弹1111
        {
            board[row][line] = 'X';
        }else if(board[row][line] == 'E')//222333
        {
            dfs(board,row,line);
        }
        return board;
    }
    void dfs(vector<vector<char>>& board,int row,int line)
    {
        int rowcount = board.size();
        int linecount = board[0].size();
        if(row > rowcount - 1 || row < 0)return;
        if(line> linecount-1 || line < 0)return;
        if(board[row][line] == 'E')
        {
            int Mcount = getMcount(board,row,line);
            if(Mcount > 0)
            {
                board[row][line] = Mcount + '0';//333
            }else{
                board[row][line] = 'B';
                
                dfs(board,row-1,line);
                dfs(board,row-1,line-1);
                dfs(board,row-1,line+1);
                dfs(board,row,line-1);

                dfs(board,row,line+1);
                dfs(board,row+1,line);
                dfs(board,row+1,line-1);
                dfs(board,row+1,line+1);
            }
        }
    }
    int getMcount(vector<vector<char>>& board,int row,int line)
    {
        int count = 0;
        int rowcount = board.size();
        int linecount = board[0].size();
        if(row-1 >= 0 && board[row-1][line] == 'M')
        {
            count++;//上
        }
        if(row-1 >= 0 && line+1 <= linecount-1 && board[row-1][line+1] == 'M')
        {
            count++;
        }
        if(row-1 >= 0 && line-1 >= 0 && board[row-1][line-1] == 'M')
        {
            count++;
        }
        if(line-1 >= 0 && board[row][line-1] == 'M')
        {
            count++;
        }
        if(line+1 <= linecount-1 && board[row][line+1] == 'M')
        {
            count++;
        }
        if(row+1 <= rowcount-1 && board[row+1][line] == 'M')
        {
            count++;
        }
        if(row+1 <= rowcount-1 && line-1 >= 0 && board[row+1][line-1] == 'M')
        {
            count++;
        }
        if(row+1 <= rowcount-1 && line+1 <= linecount-1 && board[row+1][line+1] == 'M')
        {
            count++;
        }
        return count;
    }
};