-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathminesweeper.py
70 lines (51 loc) · 2.33 KB
/
minesweeper.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
from typing import List
from collections import deque
class Solution:
@staticmethod
def updateBoard(board: List[List[str]], click: List[int]) -> List[List[str]]:
seen = set()
def scanProx(r, c):
q = deque()
q.append((r, c))
while q:
for i in range(len(q)):
c, d = q.popleft()
board[c][d] = 'B'
for x, y in directions:
valr, valc = c + x, d + y
if valr >= 0 and valr < len(b) and valc >= 0 and valc < len(b[0]):
if (valr, valc) in seen:
continue
if board[valr][valc] == "E":
if b[valr][valc] == 0:
seen.add((valr, valc))
q.append((valr, valc))
else:
board[valr][valc] = str(b[valr][valc])
b = [[0 for i in range(len(board[0]))] for j in range(len(board))]
directions = [[1, 1], [1, 0], [1, -1], [-1, -1], [-1, 0], [-1, 1], [0, 1], [0, -1]]
for r in range(len(b)):
for c in range(len(b[0])):
if board[r][c] == 'M':
for x, y in directions:
valr, valc = r + x, c + y
if valr >= 0 and valr < len(b) and valc >= 0 and valc < len(b[0]):
if board[valr][valc] == "E":
b[valr][valc] += 1
x, y = click[0], click[1]
if board[x][y] == 'E':
if b[x][y] == 0:
board[x][y] = 'B'
scanProx(x, y)
else:
board[x][y] = str(b[x][y])
elif board[x][y] == 'M':
board[x][y] = 'X'
return board
# Checking in terminal/console:
if __name__ == '__main__':
Sol = Solution()
Solve = Sol.updateBoard(board = [["E","E","E","E","E"],["E","E","M","E","E"],["E","E","E","E","E"],["E","E","E","E","E"]], click = [3,0])
# 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"]]
print(Solve)