forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsurrounded-regions.py
40 lines (32 loc) · 1.13 KB
/
surrounded-regions.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
# Time: O(m * n)
# Space: O(m + n)
import collections
class Solution(object):
# @param board, a 2D array
# Capture all regions by modifying the input board in-place.
# Do not return any value.
def solve(self, board):
if not board:
return
q = collections.deque([])
for i in xrange(len(board)):
q.append((i, 0))
q.append((i, len(board[0]) - 1))
for j in xrange(len(board[0])):
q.append((0, j))
q.append((len(board) - 1, j))
while q:
i, j = q.popleft()
if board[i][j] in ['O', 'V']:
board[i][j] = 'V'
for x, y in [(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)]:
if 0 <= x < len(board) and 0 <= y < len(board[0]) and \
board[x][y] == 'O':
board[x][y] = 'V'
q.append((x, y))
for i in xrange(len(board)):
for j in xrange(len(board[0])):
if board[i][j] != 'V':
board[i][j] = 'X'
else:
board[i][j] = 'O'