0529. Minesweeper

# 529. Minesweeper#

## 题目 #

Let’s play the minesweeper game ( Wikipediaonline 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:
``````

Note:

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.

## 题目大意 #

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

• 输入矩阵的宽和高的范围为 [1,50]。
• 点击的位置只能是未被挖出的方块 (‘M’ 或者 ‘E’)，这也意味着面板至少包含一个可点击的方块。
• 输入面板不会是游戏结束的状态（即有地雷已被挖出）。
• 简单起见，未提及的规则在这个问题中可被忽略。例如，当游戏结束时你不需要挖出所有地雷，考虑所有你可能赢得游戏或标记方块的情况。

## 解题思路 #

• 给出一张扫雷地图和点击的坐标，M 代表雷，E 代表还没有点击过的空砖块，B 代表点击过的空砖块，1-8 代表砖块周围 8 个方块里面有雷的个数，X 代表点到了雷。问点击一次以后，输出更新点击以后的地图。
• DPS 和 BFS 都可以解题。先根据原图预处理地图，记录出最终地图的状态，0 代表空白砖块，1-8 代表雷的个数，-1 代表是雷。再 DFS 遍历这张处理后的图，输出最终的地图即可。

## 代码 #

``````func updateBoard(board [][]byte, click []int) [][]byte {
if board[click[0]][click[1]] == 'M' {
board[click[0]][click[1]] = 'X'
return board
}
mineMap := make([][]int, len(board))
for i := range board {
mineMap[i] = make([]int, len(board[i]))
}
for i := range board {
for j := range board[i] {
if board[i][j] == 'M' {
mineMap[i][j] = -1
for _, d := range dir8 {
nx, ny := i+d[0], j+d[1]
if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
mineMap[nx][ny]++
}
}
}
}
}
mineSweeper(click[0], click[1], board, mineMap, dir8)
return board
}

func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) {
if board[x][y] != 'M' && board[x][y] != 'E' {
return
}
if mineMap[x][y] == -1 {
board[x][y] = 'X'
} else if mineMap[x][y] > 0 {
board[x][y] = '0' + byte(mineMap[x][y])
} else {
board[x][y] = 'B'
for _, d := range dir8 {
nx, ny := x+d[0], y+d[1]
if isInBoard(board, nx, ny) && mineMap[nx][ny] >= 0 {
mineSweeper(nx, ny, board, mineMap, dir8)
}
}
}
}
``````

Sep 6, 2020