Minesweeper
来源:互联网 发布:java趣味编程100例 pdf 编辑:程序博客网 时间:2024/04/19 14:20
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.
思路就是dfs,如果碰到空格的情况,那么计算周围mine的个数,如果等于0, 那么需要遍历周围的点;如果不为零,那么需要展示出附近mine的个数,并且不需要遍历周围的点。
代码:
private static final int[] direction = {-1, 0, 1}; public char[][] updateBoard(char[][] board, int[] click) { reveal(board, click[0], click[1]); return board; } private void reveal(char[][] board, int x, int y) { if(x<0 || y<0 || x>board.length-1 || y>board[0].length-1) return; if(board[x][y] == 'M') { board[x][y] = 'X' ; return; } if(board[x][y] == 'E') { int count = calNeighbour(board, x, y); //System.out.printf("x: %d, y: %d, count: %d\n", x, y, count); if(count == 0) { board[x][y] = 'B'; //dfs for(int i=0;i<direction.length;i++) { for(int j=0;j<direction.length;j++) { if(direction[i] == 0 && direction[j] == 0) continue; if(valid(board, x+direction[i], y+direction[j])){ reveal(board, x+direction[i], y+direction[j]); } } } } else { board[x][y] = (char) (count + '0'); } }else return; } private int calNeighbour(char[][] board, int x, int y) { int sum = 0; for(int i=0;i<direction.length;i++) { for(int j=0;j<direction.length;j++) { if(direction[i] == 0 && direction[j] == 0) continue; if(valid(board, x+direction[i], y+direction[j])){ if(board[x+direction[i]][y+direction[j]] == 'M') sum +=1; } } } return sum; } private boolean valid(char[][] board, int x, int y) { return x>=0 && y>=0 && x<board.length && y<board[0].length; }
- 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
- mongoDB (mongoose、增删改查、聚合、索引、连接、备份与恢复、监控等等)
- Express (Routing、Middleware、托管静态文件、view engine 等等)
- Reverse String II
- JavaScript ES6 规范
- Beginning Spring学习笔记——第6章(一)Spring事务管理基础
- Minesweeper
- 如何创建一个基本JQuery的插件
- SVN
- Linux Centos7安装Oracle12c第二版本
- java webservice
- java练习-字符串排序
- MyEclipse上Git的使用(包含导入和导出)
- K-diff Pairs in an Array
- Cadence