【转载】【leetcode】Surrounded regions

最新推荐文章于 2020-08-11 10:37:01 发布

转载最新推荐文章于 2020-08-11 10:37:01 发布 · 507 阅读

算法同时被 2 个专栏收录

105 篇文章

订阅专栏

leetcode

79 篇文章

订阅专栏

本文详细介绍了如何使用BFS算法解决二维图中特定条件下的元素转换问题，即在二维图中找到所有被X包围的O元素，并将它们转换为X。通过从O元素开始进行广度优先搜索，记录遍历路径并检查是否在边界以内，最终实现目标元素的转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Surrounded regions

题意：假设一个二维图由X和O组成，将所有被X围住的O转换成X

如：XXXX

XOOX

XXOX

XOXX
变成：XXXX

XXXX

XOXX

思路：从O处开始BFS，用一个队列记录遍历的路径，如果这条路径都是在边界以内，没有超出边界，则将路径上所有的O变成X

代码：

void solve(vector<vector<char>> &board) {

        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        int N = board.size();
        if (N == 0) return;
        int M = board[0].size();
        if (M == 0) return;
        vector<vector<bool> > mark(N, vector<bool>(M, false));
        
        int dx[4] = {-1, 1, 0, 0};//上下左右四个方向
        int dy[4] = {0, 0, -1, 1};
        
        for (int i = 0; i < N; i++)
            for (int j = 0; j < M; j++)
            {
                if (!mark[i][j] && board[i][j] == 'O')
                {
                    vector<int> queX, queY;//遍历路径
                    queX.push_back(i);
                    queY.push_back(j);
                    mark[i][j] = true;
                    int head = 0;
                    bool result = !(i == 0 || j == 0 || i == N - 1 || j == M - 1) ;//是否在边界以内
                    
                    while (head < queX.size())
                    {
                        int nx = queX[head];
                        int ny = queY[head];
                        head++;
                        for (int i = 0; i < 4; i++)
                        {
                            int nextX = nx + dx[i];
                            int nextY = ny + dy[i];
                            if (nextX >= 0 && nextX < N && nextY >= 0 && nextY < M)
                            {
                                if (!mark[nextX][nextY] && board[nextX][nextY] == 'O')
                                {
                                    mark[nextX][nextY] = true;
                                    queX.push_back(nextX);
                                    queY.push_back(nextY);
                                    if (nextX == 0 || nextY == 0 || nextX == N - 1 || nextY == M - 1) //遍历到了边界
                                        result = false;
                                }
                            }
                        }
                    }
                    if (result)
                    {
                        for (int i = 0; i < queX.size(); i++)
                            board[queX[i]][queY[i]] = 'X';
                    }
                }
            }
    }