#leetcode编程日记#529. Minesweeper

题目描述：

Let's play the minesweeper game (Wikipedia, online game)!

You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E' represents an unrevealed empty square, 'B' represents a revealed blank square that has no adjacent (above, below, left, right, and all 4 diagonals) mines, digit ('1' to '8') represents how many mines are adjacent to this revealed square, and finally 'X' represents a revealed mine.

Now given the next click position (row and column indices) among all the unrevealed squares ('M' or 'E'), return the board after revealing this position according to the following rules:

1. If a mine ('M') is revealed, then the game is over - change it to 'X'.
2. If an empty square ('E') with no adjacent mines is revealed, then change it to revealed blank ('B') and all of its adjacent unrevealed squares should be revealed recursively.
3. If an empty square ('E') with at least one adjacent mine is revealed, then change it to a digit ('1' to '8') representing the number of adjacent mines.
4. Return the board when no more squares will be revealed.

样例：

Example 1:

Input: 

[['E', 'E', 'E', 'E', 'E'],
 ['E', 'E', 'M', 'E', 'E'],
 ['E', 'E', 'E', 'E', 'E'],
 ['E', 'E', 'E', 'E', 'E']]

Click : [3,0]

Output: 

[['B', '1', 'E', '1', 'B'],
 ['B', '1', 'M', '1', 'B'],
 ['B', '1', '1', '1', 'B'],
 ['B', 'B', 'B', 'B', 'B']]

Explanation:

Example 2:

Input: 

[['B', '1', 'E', '1', 'B'],
 ['B', '1', 'M', '1', 'B'],
 ['B', '1', '1', '1', 'B'],
 ['B', 'B', 'B', 'B', 'B']]

Click : [1,2]

Output: 

[['B', '1', 'E', '1', 'B'],
 ['B', '1', 'X', '1', 'B'],
 ['B', '1', '1', '1', 'B'],
 ['B', 'B', 'B', 'B', 'B']]

Explanation:

注意事项：

1. The range of the input matrix's height and width is [1,50].
2. The click position will only be an unrevealed square ('M' or 'E'), which also means the input board contains at least one clickable square.
3. The input board won't be a stage when game is over (some mines have been revealed).
4. For simplicity, not mentioned rules should be ignored in this problem. For example, you don't need to reveal all the unrevealed mines when the game is over, consider any cases that you will win the game or flag any squares.

解题思路：

递归题。只需要判断当前点击的是地雷‘M’还是空白‘E’。

①是‘M’就很简单了，直接把当前的‘M’改为点爆的地雷‘X’即可。

②是空白‘E’：

a.以当前点为中心的3*3方块中没有雷就置‘B’，并开始递归访问邻接点。

b.有雷就置雷的数目。不递归下去。

注意：一开始我觉得需要递归的邻接点指的是上下左右四个方向的，结果第一次没AC。后来改为递归以当前点为中心的3*3方块中的其他所有非地雷点就通过了。

欢迎评论交流~~

代码：

class Solution {
public:
    vector<vector<char>> updateBoard(vector<vector<char>>& board, vector<int>& click) {
        int i=click[0],j=click[1];
        if(board[i][j]=='M'){
            board[i][j]='X';
            return board;
        }
        dfs(board,i,j);
        return board;
    }
    void dfs(vector<vector<char>>& board,int i,int j){
        if(board[i][j]=='E'){
            int cnt=0;
            for(int k=(i-1>0?i-1:0);k<board.size()&&k<=i+1;k++){
                for(int w=(j-1>0?j-1:0);w<board[0].size()&&w<=j+1;w++){
                    if(board[k][w]=='M')
                        ++cnt;
                }
            }
            if(cnt>0){
                board[i][j]=cnt+'0';          
            }
            else{
                board[i][j]='B';
                if(i>0&&board[i-1][j]=='E')dfs(board,i-1,j);
                if((i<board.size()-1)&&(board[i+1][j]=='E'))dfs(board,i+1,j);
                if(j>0&&board[i][j-1]=='E')dfs(board,i,j-1);
                if(j<board[0].size()-1&&board[i][j+1]=='E')dfs(board,i,j+1);
                
                if(i>0&&j>0&&board[i-1][j-1]=='E')dfs(board,i-1,j-1);
                if((i<board.size()-1)&&(j>0)&&(board[i+1][j-1]=='E'))dfs(board,i+1,j-1);
                if(i>0&&j<board[0].size()-1&&board[i-1][j+1]=='E')dfs(board,i-1,j+1);
                if(i<board.size()-1&&j<board[0].size()-1&&board[i+1][j+1]=='E')dfs(board,i+1,j+1);
            }

        }
    }
};