72/300
- 被围绕的区域
给定一个二维的矩阵,包含 ‘X’ 和 ‘O’(字母 O)。
找到所有被 ‘X’ 围绕的区域,并将这些区域里所有的 ‘O’ 用 ‘X’ 填充。
示例:
X X X X
X O O X
X X O X
X O X X
运行你的函数后,矩阵变为:
X X X X
X X X X
X X X X
X O X X
解释:
被围绕的区间不会存在于边界上,换句话说,任何边界上的 ‘O’ 都不会被填充为 ‘X’。 任何不在边界上,或不与边界上的 ‘O’ 相连的 ‘O’ 最终都会被填充为 ‘X’。如果两个元素在水平或垂直方向相邻,则称它们是“相连”的。
跟这道200 岛屿数量基本一样。
思路:把四个边儿上的("O"及其延伸“O”)都变成“M”, 这里用dfs。
[["O","O","X","X"],
["O","X","O","X"],
["X","X","O","X"],
["X","O","X","X"]]
[["M","M","X","X"],
["M","X","O","X"],
["X","X","O","X"],
["X","M","X","X"]]
之后遍历,“M"变回"O”,“O”变成“X”。
class Solution:
def solve(self, board: List[List[str]]) -> None:
"""
Do not return anything, modify board in-place instead.
"""
if not board: return
r, c = len(board), len(board[0])
def dfs(i,j): # O -> M
if 0 <= i < r and 0 <= j < c and board[i][j] == 'O':
board[i][j] = 'M'
list(map(dfs, (i+1, i, i-1, i), (j, j+1, j, j-1)))
for i in range(r): #左右两边儿
list(map(dfs, (i, i),(0, c-1)))
for j in range(c): #上下两边儿
list(map(dfs, (0, r-1),(j, j)))
for i in range(r):
for j in range(c):
board[i][j] = 'O' if board[i][j] == 'M' else 'X'