Leetcode130. 被围绕的区域

题目：

---

代码(首刷自解 2024年3月18日 DFS）：

        太丑了，其实可以不用visited，可以在原board上改；下次刷的时候注意

class Solution {
public:
    void solve(vector<vector<char>>& board) {
        vector<vector<bool>> visited(board.size(), vector<bool>(board[0].size(), false));
        for (int i = 0; i < board.size(); ++i)
        {
            if (board[i][0] == 'O')
            {
                visited[i][0] = true;
                dfs(board, visited, i, 0, 0);
            }
            if (board[i][board[0].size() - 1] == 'O')
            {
                visited[i][board[0].size() - 1] = true;
                dfs(board, visited, i, board[0].size() - 1,0);
            }
        }
        for (int i = 0; i < board[0].size(); ++i)
        {
            if (board[0][i] == 'O')
            {
                visited[0][i] = true;
                dfs(board, visited, 0, i,0);
            }
            if (board[board.size() - 1][i] == 'O')
            {
                visited[board.size() - 1][i] = true;
                dfs(board, visited, board.size() - 1, i,0);
            }
        }
        for (int i = 0; i < board.size(); ++i)
        {
            for (int j = 0; j < board[0].size(); ++j)
            {
                if (visited[i][j] == false && board[i][j] == 'O')
                {
                    board[i][j] = 'X';
                }
            }
        }
    }
    int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
    void dfs(vector<vector<char>>& board, vector<vector<bool>>& isvisited, int row, int col, int e)
    {
        for (int i = 0; i < 4; ++i)
        {
            int newrow = row + dir[i][0];
            int newcol = col + dir[i][1];
            if (newrow >= 0 && newrow < board.size() && newcol >= 0 && newcol < board[0].size()
            && board[newrow][newcol] == 'O' && isvisited[newrow][newcol] == false && e == 0)
            {
                isvisited[newrow][newcol] = true;
                dfs(board, isvisited, newrow, newcol,0);
            }
            else if (newrow >= 0 && newrow < board.size() && newcol >= 0 && newcol < board[0].size()
            && board[newrow][newcol] == 'O' && isvisited[newrow][newcol] == false && e == 1)
            {
                board[newrow][newcol] = 'X';
                dfs(board, isvisited, newrow, newcol,1);
            }
        }
    }
};