leetcode- 被围绕的区域

https://leetcode-cn.com/problems/surrounded-regions/

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

如果 O 区域不被围绕 则必有一个 O 处于边界上
一次从边界开始寻找区域 比较为不改变 其余 O 变为 X 即可

class Solution {
 public void solve(char[][] board) {
        int rows = board.length; 
        if (rows <= 0) {
            return;
        }
        int cols = board[0].length;
        
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (i == 0 || j == 0 || i == rows - 1 || j == cols-1) {
                    if (board[i][j] == 'O') {
                        mark(i, j, board);
                    }
                }
            }
        }


        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (board[i][j] == 'A') {
                    board[i][j] = 'O';
                } else if (board[i][j] == 'O') {
                    board[i][j] = 'X';
                }
            }
        }
        
    }

    private void mark(int i, int j, char[][] board) {
        if (i < 0 || j < 0 || i >= board.length || j >= board[0].length) {
            return;
        }
        if (board[i][j] != 'O') {
            return;
        }
        board[i][j] = 'A';

        mark(i + 1, j, board);
        mark(i - 1, j, board);
        mark(i, j + 1, board);
        mark(i, j - 1, board);
    
    }
}