leetcode 130 被围绕的区域 C语言实现

题目

给定一个二维的矩阵，包含 ‘X’ 和 ‘O’（字母 O）。
找到所有被 ‘X’ 围绕的区域，并将这些区域里所有的 ‘O’ 用 ‘X’ 填充。
示例:
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所联通区域全部先标记为#，学习题解

void dfs(char **board, int i, int j, int boardSize, int *boardColSize) {
    if (i < 0 || i >= boardSize || j < 0 || j >= *boardColSize || board[i][j] == 'X' || board[i][j] == '#') 
        return ;
    board[i][j] = '#';
    dfs(board, i - 1, j, boardSize, boardColSize);
    dfs(board, i + 1, j, boardSize, boardColSize);
    dfs(board, i, j - 1, boardSize, boardColSize);
    dfs(board, i, j + 1, boardSize, boardColSize);
}
void solve(char** board, int boardSize, int* boardColSize){
    //dfs
    for (int i = 0; i < boardSize; i++) {
        for (int j = 0; j < *boardColSize; j++) {
            if (i != 0 && i != boardSize - 1 && j != 0 && j != *boardColSize - 1) continue;
            if (board[i][j] == 'O') 
                dfs(board, i, j, boardSize, boardColSize);
        }
    }
    for (int i = 0; i < boardSize; i++) {
        for (int j = 0; j < *boardColSize; j++) {
            if (board[i][j] == '#') {
                board[i][j] = 'O';
            } else if (board[i][j] == 'O') {
                board[i][j] = 'X';
            }
        }
    }
}