【C++】【leetcode130】被围绕的区域（DFS）

被围绕的区域

DFS解题思路

• 图的深度优先搜索
  这里有一个思路：利用占位符去标记，就不需要有一个新的标记数组
• board[x][y] != 'O'直接返回，所以不需要去考虑越界的问题，因为下一轮递归的时候，borad已经被改变了，所以不会进入反复递归

class Solution {
public:
    int n, m;
    void dfs(vector<vector<char>>& board, int x, int y) {
        if(x < 0 || y < 0||x > n - 1 || y > m - 1 || board[x][y] != 'O')return;
        board[x][y] = 'A';
        //检查上下左右是否连通
        dfs(board,x + 1,y);
        dfs(board,x - 1,y);
        dfs(board,x,y + 1);
        dfs(board,x,y - 1);
    }
    void solve(vector<vector<char>>& board) {
        n = board.size();
        if (n == 0) return;
        m = board[0].size();
        
        for (int i = 0; i < n; i++) {
            dfs(board, i, 0);
            dfs(board, i, m - 1);
        }
        for (int i = 1; i < m - 1; i++) {
            dfs(board, 0, i);
            dfs(board, n - 1, i);
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (board[i][j] == 'A') {
                    board[i][j] = 'O';
                } else if (board[i][j] == 'O') {
                    board[i][j] = 'X';
                }
            }
        }
    }
};

省份数量
岛屿数量

一个更好的写法

用偏移量去记录上下左右

int dr[4] = {-1,1,0,0};
int dc[4] = {0,0,-1,1};

class Solution {
public:
    int n,m;
    //偏移量上下左右
    int dr[4] = {-1,1,0,0};
    int dc[4] = {0,0,-1,1};
    void dfs(vector<vector<char>>& board,int r,int c){
        board[r][c] = '#';
        for(int i = 0;i < 4;++i){
            int rr = r + dr[i];
            int cc = c + dc[i];
            if(rr < 0 || rr >= n || cc < 0 || cc >= m || board[rr][cc] != 'O')continue;
            dfs(board,rr,cc);
        }
    }
    void solve(vector<vector<char>>& board) {
        n = board.size();
        m = board[0].size();
        for(int i = 0;i < n;++i)
            for(int j = 0;j < m;++j){
                if((i == 0 || j == 0||i == n-1||j == m-1) && board[i][j] == 'O'){
                    dfs(board,i,j);
                }
            }
        for(int i = 0;i < n;++i){
            for(int j = 0;j < m;++j){
                if(board[i][j] == '#')board[i][j] = 'O';
                else if(board[i][j] == 'O')board[i][j] = 'X';
            }
        }
    }
};