之前不喜欢游戏,我才发现我之前有多做作。刚玩了几把游戏,哈哈哈哈哈哈,差点就赢了😭,虽然还是简单局!但足以摸清一小点规则。之前练过一些dfs的题,这个题也不算难,这个游戏还挺好玩,记录一下第一次赢嘿嘿😋。
小结一下规则:
1.当揭示一个空白方格(周围没有雷)时,游戏会自动揭示周围的方格。
2.每个数字表示该方格周围的雷的数量,周围就按照米字型!
3.点到雷,玩家out
问题来了:它这种规则的逻辑又该怎么实现?
让我们一起来玩扫雷游戏!
给你一个大小为
m x n
二维字符矩阵board
,表示扫雷游戏的盘面,其中:
'M'
代表一个 未挖出的 地雷,'E'
代表一个 未挖出的 空方块,'B'
代表没有相邻(上,下,左,右,和所有4个对角线)地雷的 已挖出的 空白方块,- 数字(
'1'
到'8'
)表示有多少地雷与这块 已挖出的 方块相邻,'X'
则表示一个 已挖出的 地雷。给你一个整数数组
click
,其中click = [clickr, clickc]
表示在所有 未挖出的 方块('M'
或者'E'
)中的下一个点击位置(clickr
是行下标,clickc
是列下标)。根据以下规则,返回相应位置被点击后对应的盘面:
- 如果一个地雷(
'M'
)被挖出,游戏就结束了- 把它改为'X'
。- 如果一个 没有相邻地雷 的空方块(
'E'
)被挖出,修改它为('B'
),并且所有和其相邻的 未挖出 方块都应该被递归地揭露。- 如果一个 至少与一个地雷相邻 的空方块(
'E'
)被挖出,修改它为数字('1'
到'8'
),表示相邻地雷的数量。- 如果在此次点击中,若无更多方块可被揭露,则返回盘面。
示例 1:
输入:board = [["E","E","E","E","E"],["E","E","M","E","E"],["E","E","E","E","E"],["E","E","E","E","E"]], click = [3,0] 输出:[["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]示例 2:
输入:board = [["B","1","E","1","B"],["B","1","M","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]], click = [1,2] 输出:[["B","1","E","1","B"],["B","1","X","1","B"],["B","1","1","1","B"],["B","B","B","B","B"]]提示:
m == board.length
n == board[i].length
1 <= m, n <= 50
board[i][j]
为'M'
、'E'
、'B'
或数字'1'
到'8'
中的一个click.length == 2
0 <= clickr < m
0 <= clickc < n
board[clickr][clickc]
为'M'
或'E'
class Solution { int[] dx = {0, 1, 0, -1, 1, 1, -1, -1}; int[] dy = {1, 0, -1, 0, 1, -1, 1, -1}; public char[][] updateBoard(char[][] board, int[] click) { int x = click[0], y = click[1]; if (board[x][y] == 'M') { board[x][y] = 'X'; return board; } dfs(board,x,y); return board; } public void dfs(char[][] board, int x, int y) { int cnt = 0; for (int i = 0; i < 8; ++i) {//雷的个数 int tx = x + dx[i]; int ty = y + dy[i]; if (tx>=0&&tx<board.length&&ty>= 0&&ty<board[0].length&&board[tx][ty] == 'M') { cnt++; } } if (cnt > 0) { board[x][y] = (char) (cnt + '0'); return; } else {//周围无雷 board[x][y] = 'B'; for (int i = 0; i < 8; ++i) { int tx = x + dx[i]; int ty = y + dy[i]; if (tx>=0&&tx<board.length&&ty>= 0&&ty<board[0].length&&board[tx][ty] =='E') { dfs(board, tx, ty); } } } } }