Minesweeper
来源:互联网 发布:网络测试仪价格 编辑:程序博客网 时间:2024/04/27 00:13
题目来源LeetCode
题目描述
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.
这道题就是一个扫雷的游戏,我的做法还是利用DFS遍历周围8个格子,在根据情况进行变换,代码如下:
void change(vector<vector<char>>& board,vector<int>& click){ int r = click[0]; int c = click[1]; if(r >= board.size() || r < 0 || c < 0 || c > board[0].size()) return; if(board[r][c] == 'E'){ int mines = 0; for(int dr = -1; dr <2; dr++){ for(int dl = -1; dl < 2; dl++){ if(r+dr < board.size() && r+dr >= 0 && c+dl >= 0 && c+dl < board[0].size()){ if(board[r+dr][c+dl] == 'M')mines++; } } } if(mines != 0) board[r][c] = '0'+mines; else{ board[r][c] = 'B'; for(int dr = -1; dr <2; dr++){ for(int dl = -1; dl < 2; dl++){ if(r+dr < board.size() && r+dr >= 0 && c+dl >= 0 && c+dl < board[0].size()){ click[0] = r+dr; click[1] = c+dl; change(board,click); } } } } }}class Solution {public: vector<vector<char>> updateBoard(vector<vector<char>>& board, vector<int>& click) { if(board[click[0]][click[1]] == 'M') { board[click[0]][click[1]] = 'X'; return board; } change(board,click); return board; }};
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- Minesweeper
- 10189 - Minesweeper
- UVa10189 Minesweeper
- UVa10189 - Minesweeper
- 10189 - Minesweeper
- uva minesweeper
- 110102 MineSweeper
- MINESWEEPER题解
- 10189 - Minesweeper
- java使用POI实现替换文件中指定关键字(二)
- BigDecimal构造函数传Double类型的值,精度问题
- [BZOJ4671/JZOJ4591]异或图
- ThinkPHP数据表下划线使用方法
- 聚类算法总结
- Minesweeper
- 56. 两数之和
- 新时期,新计划,不能闲下来!
- webpack 初探
- C++使用OLE高速读写EXCEL的源码
- 学习淘淘商城第一百零九课(tomcat热部署)
- 关于centos 7 中service iptables save 指令使用失败的结局方案
- 禅道数据复原
- poj 图相关之2485Highways