其他分享
首页 > 其他分享> > Leetcode No.130 被围绕的区域(DFS)

Leetcode No.130 被围绕的区域(DFS)

作者:互联网

一、题目描述

给你一个 m x n 的矩阵 board ,由若干字符 'X' 和 'O' ,找到所有被 'X' 围绕的区域,并将这些区域里所有的 'O' 用 'X' 填充。

示例 1:
输入:board = [["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'。如果两个元素在水平或垂直方向相邻,则称它们是“相连”的。

示例 2:
输入:board = [["X"]]
输出:[["X"]]

提示:

m == board.length
n == boa

标签:边界,填充,示例,围绕,DFS,区域,board,No.130,Leetcode
来源: https://blog.csdn.net/jxq0816/article/details/120432662