[LeetCode] 529. Minesweeper
来源:互联网 发布:js判断标签是否隐藏 编辑:程序博客网 时间:2024/04/30 01:19
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:
If a mine (‘M’) is revealed, then the game is over - change it to ‘X’.
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.
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.
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:
The range of the input matrix’s height and width is [1,50].
The click position will only be an unrevealed square (‘M’ or ‘E’), which also means the input board contains at least one clickable square.
The input board won’t be a stage when game is over (some mines have been revealed).
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.
class Solution {public: vector<vector<char>> updateBoard(vector<vector<char>>& board, vector<int>& click) { int x = click[0], y = click[1]; if (board[x][y] == 'M') { board[x][y] = 'X'; return board; } updateBoard(board, x, y); return board; }private: void updateBoard(vector<vector<char>>&board, int x, int y) { if (board[x][y] != 'E') return; int startx = max(x - 1, 0), endx = min((int)board.size() - 1, x + 1); int starty = max(y - 1, 0), endy = min((int)board[0].size() - 1, y + 1); int NMines = 0; for (int i = startx; i <= endx; i++) { for (int j = starty; j <= endy; j++) { if (board[i][j] == 'M') NMines++; } } if (NMines != 0) { board[x][y] = '0' + NMines; } else { board[x][y] = 'B'; for (int i = startx; i <= endx; i++) { for (int j = starty; j <= endy; j++) { updateBoard(board, i, j); } } } }};
- Leetcode 529. Minesweeper
- LeetCode: 529. Minesweeper
- [LeetCode]529. Minesweeper
- [leetcode] 529. Minesweeper
- [leetcode] 529. Minesweeper
- 【Leetcode】529. Minesweeper
- LeetCode 529. Minesweeper
- 【LeetCode】529. Minesweeper
- leetcode 529. Minesweeper
- [leetcode]529. Minesweeper
- [LeetCode] 529. Minesweeper
- LeetCode:529. Minesweeper
- LeetCode 529. Minesweeper
- LeetCode 529. Minesweeper 解题报告
- #leetcode编程日记#529. Minesweeper
- [Leetcode] 529. Minesweeper 解题报告
- 529. Minesweeper
- 529. Minesweeper
- CodeForces 835C Star sky
- 【转】css样式自动换行(强制换行)
- filter拦截修改response
- CSU-ACM2017暑期训练3-递推与递归 Erratic Expansion
- 来自<c primer plus >的随记
- [LeetCode] 529. Minesweeper
- git使用方法
- Git 首次使用心得
- 2017年8月1日,星期二
- HDU-6060 RXD and dividing
- 乐观锁的两种实现方式
- 动态添加一个HTML标记
- HEVC函数入门(17)——编码一个CU
- 2.1.3—线性表—Search in Rotated Sorted Array