【LeetCode】 130. Surrounded Regions 被围绕的区域（Medium）（JAVA）

【LeetCode】 130. Surrounded Regions 被围绕的区域（Medium）（JAVA）

题目地址: https://leetcode.com/problems/surrounded-regions/

题目描述：

Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’.

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

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

Explanation:

Surrounded regions shouldn’t be on the border, which means that any ‘O’ on the border of the board are not flipped to ‘X’. Any ‘O’ that is not on the border and it is not connected to an ‘O’ on the border will be flipped to ‘X’. Two cells are connected if they are adjacent cells connected horizontally or vertically.

题目大意

给定一个二维的矩阵，包含 ‘X’ 和 ‘O’（字母 O）。

找到所有被 ‘X’ 围绕的区域，并将这些区域里所有的 ‘O’ 用 ‘X’ 填充。

解题方法

1. 如果遇到了非在边上的 ‘O’ ，开始遍历这个区块，看看是否靠近了边界；如果没有靠近边界，在遍历一次把所有的 ‘O’ 变为 ‘X’ ，否则不改变
2. 遍历 board 上所有元素

class Solution {
    public void solve(char[][] board) {
        if (board.length == 0 || board[0].length == 0) return;
        boolean[][] checked = new boolean[board.length][board[0].length];
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                if (board[i][j] =='X') continue;
                if (checked[i][j]) continue;
                if (sH(board, checked, i, j)) change(board, i, j);
            }
        }
    }

    public boolean sH(char[][] board, boolean[][] checked, int i, int j) {
        if (board[i][j] == 'X') return true;
        if (i == 0 || i == board.length - 1 || j == 0 || j == board[0].length - 1) return false;
        if (checked[i][j]) return true;
        checked[i][j] = true;
        boolean flag = sH(board, checked, i + 1, j);
        flag &= sH(board, checked, i - 1, j);
        flag &= sH(board, checked, i, j + 1);
        flag &= sH(board, checked, i, j - 1);
        return flag;
    }

    public void change(char[][] board, int i, int j) {
        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length) return;
        if (board[i][j] == 'X') return;
        board[i][j] = 'X';
        change(board, i + 1, j);
        change(board, i - 1, j);
        change(board, i, j + 1);
        change(board, i, j - 1);
    }
}

执行耗时:7 ms,击败了11.70% 的Java用户
内存消耗:46.1 MB,击败了5.00% 的Java用户

优化

1. 先把所有在边上的 ‘O’ 连接的所有 ‘O’ 遍历一遍，这些是不用改为 ‘X’ 的
2. 再遍历 board 上剩下 ‘O’ 都需要改为 ‘X’

class Solution {
    public void solve(char[][] board) {
        if (board.length == 0 || board[0].length == 0) return;
        boolean[][] checked = new boolean[board.length][board[0].length];
        for (int i = 0; i < board.length; i++) {
            if (board[i][0] == 'O') change(board, checked, false, i, 0);
            if (board[i][board[0].length - 1] == 'O') change(board, checked, false, i, board[0].length - 1);
        }
        for (int i = 0; i < board[0].length; i++) {
            if (board[0][i] == 'O') change(board, checked, false, 0, i);
            if (board[board.length - 1][i] == 'O') change(board, checked, false, board.length - 1, i);
        }
        
        for (int i = 1; i < board.length - 1; i++) {
            for (int j = 1; j < board[0].length - 1; j++) {
                if (board[i][j] =='X' || checked[i][j]) continue;
                board[i][j] = 'X';
            }
        }
    }

    public void change(char[][] board, boolean[][] checked, boolean needChange, int i, int j) {
        if (i < 0 || i >= board.length || j < 0 || j >= board[0].length) return;
        if (board[i][j] == 'X' || checked[i][j]) return;
        if (needChange) board[i][j] = 'X';
        checked[i][j] = true;
        change(board, checked, needChange,i + 1, j);
        change(board, checked, needChange, i - 1, j);
        change(board, checked, needChange, i, j + 1);
        change(board, checked, needChange, i, j - 1);
    }
}

执行耗时:2 ms,击败了96.32% 的Java用户
内存消耗:40.8 MB,击败了65.28% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新