[leetcode-130]Surrounded Regions(java)

最新推荐文章于 2021-03-10 11:43:10 发布

zdavb

最新推荐文章于 2021-03-10 11:43:10 发布

阅读量1.3k

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/zdavb/article/details/47450743

版权

leetcode 专栏收录该内容

243 篇文章 0 订阅

订阅专栏

问题描述：
Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’.

A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region.

For example,
X X X X
X O O X
X X O X
X O X X
After running your function, the board should be:

X X X X
X X X X
X X X X
X O X X

分析：这道题非常有意思，最开始我的想法是，从row = 1和col = 1的位置开始搜索，因为显然，最外层的O是不可能被包围的。可是后来一想，这样时间复杂度为O(N3)。而且也实在是太丑了。
接着想到，既然最外层的不会被包围，那如果最外层某个位置为O，那么紧挨着它的所有位置的O都不会被包围，因此，实际上是使用BFS的方法，利用一个队列的数据结构。
还有一点，在代码中，我新开辟了一个矩阵，visited，其实完全可以利用原来矩阵的信息存储。比如对于不会被包围的元素，将其变成P，这样当遇到P时，就将其恢复为O，否则为X。

代码如下：356ms

public class Solution {
    class Node{
        int row;
        int col;
        Node(int x,int y){
            row = x;col = y;
        }
    }
    public void solve(char[][] board) {
        int rowLen = board.length;
        if(rowLen<=0)
            return;
        int colLen = board[0].length;
        if(colLen<=0)
            return;


        int[][] visited = new int[rowLen][colLen];
        Queue<Node> queue = new LinkedList<>();

        for(int row = 0;row<rowLen;row++)
            for(int col = 0;col<colLen;col++)
                visited[row][col] = 0;

        for(int row = 0;row<rowLen;row++)
        {
            if(board[row][0]=='O')
                queue.offer(new Node(row,0));
            if(board[row][colLen-1] == 'O')
                queue.offer(new Node(row,colLen-1));
        }
        for(int col = 0;col<colLen;col++){
            if(board[0][col]=='O')
                queue.offer(new Node(0,col));
            if(board[rowLen-1][col]=='O')
                queue.offer(new Node(rowLen-1,col));
        }
         while(!queue.isEmpty()){
                Node top = queue.poll();
                int rowrow = top.row;
                int colcol = top.col;
                if(visited[rowrow][colcol] == 1)
                    continue;

                visited[rowrow][colcol] = 1;

                if(rowrow+1<rowLen && board[rowrow+1][colcol] == 'O' && visited[rowrow+1][colcol] == 0)
                    queue.offer(new Node(rowrow+1,colcol));
                if(rowrow-1>=0 && board[rowrow-1][colcol] == 'O' && visited[rowrow-1][colcol] == 0)
                    queue.offer(new Node(rowrow-1,colcol));
                if(colcol+1<colLen && board[rowrow][colcol+1] == 'O' && visited[rowrow][colcol+1] == 0)
                    queue.offer(new Node(rowrow,colcol+1));
                if(colcol-1>=0 && board[rowrow][colcol-1] == 'O' && visited[rowrow][colcol-1] == 0)
                    queue.offer(new Node(rowrow,colcol-1));
            }
        for(int row = 0;row<rowLen;row++){
            for(int col = 0;col<colLen;col++){
                if(board[row][col] == 'O' && visited[row][col] == 0)
                    board[row][col] = 'X';
            }
        }
    }
}