leetcode算法题--Surrounded Regions

原题链接：https://leetcode.com/problems/surrounded-regions/

class Solution {
public:
    int m, n;
    void solve(vector<vector<char>>& board) {
        m = board.size(), n = board[0].size();
        for (int i = 0; i < m; i ++ ) {
            if (board[i][0] == 'O') dfs(board, i, 0);
            if(board[i][n - 1] == 'O') dfs(board, i, n - 1);            
        }
        for (int i = 0; i < n; i ++ ) {
            if (board[0][i] == 'O') dfs(board, 0, i);
            if (board[m - 1][i] == 'O') dfs(board, m - 1, i);
        }
        for (int i = 0; i < m; i ++ ) {
            for (int j = 0; j < n; j ++ ) {
                board[i][j] = board[i][j] == 'Y' ? 'O' : 'X';
            }
        }
    }
    void dfs(vector<vector<char>>& board, int r, int c) {
        int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
        board[r][c] = 'Y';
        for (int i = 0; i < 4; i ++ ) {
            int x = r + dx[i], y = c + dy[i];
            if (x >= 0 && x < m && y >= 0 && y < n && board[x][y] == 'O') {
                dfs(board, x, y);
            }
        }
    }
};