leetcode:Surrounded Regions

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.

A region is captured by flipping all 'O's into 'X's in that surrounded region.

For example,

X X X X
X O O X
X X O X
X O X X

After running your function, the board should be:

X X X X
X X X X
X X X X
X O X X

题目意思：找出所有被X包围的O组成的区域，并把这些区域全部替换成X；

解题思路：

1，先从最外围开始遍历，将最外围的O暂时替换成P；然后深搜把与P相邻的O也替换成P...

2，将O替换成X,P恢复成O

AC代码：

class Solution {
public:
    void solve(vector<vector<char>> &board) {
        //如果行或列小于等于2则不包含被包围的O直接返回
        int m = board.size();
        if(m <= 2) return;
        int n = board[0].size();
        if(n <= 2) return;
        
        //先遍历最上面的那一行
        for(int i = 0;i < n;i++){
            if(board[0][i] == 'O'){
                //标记为#
                board[0][i] = 'P';
                dfs(board,0,i,m,n);
            }
        }
        
        //遍历最下面那一行
        for(int i = 0;i < n;i++){
            if(board[m - 1][i] == 'O'){
                //标记为#
                board[m - 1][i] = 'P';
                dfs(board,m - 1,i,m,n);
            }
        }
        
        //遍历最左边那一行
        for(int i = 0;i < m;i++){
            if(board[i][0] == 'O'){
                //标记为#
                board[i][0] = 'P';
                dfs(board,i,0,m,n);
            }
        }
        
        //遍历最右边那一行
        for(int i = 0;i < m;i++){
            if(board[i][n - 1] == 'O'){
                //标记为#
                board[i][n - 1] = 'P';
                dfs(board,i,n - 1,m,n);
            }
        }
        
        //最后遍历一遍，把O替换成X，把P替换成O
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                if(board[i][j] == 'O') board[i][j] = 'X';
                else if(board[i][j] == 'P') board[i][j] = 'O';
            }
        }
        
    }
private:
    void dfs(vector<vector<char>> &board,int i,int j,int m,int n){
        //如果该点的上面的点未到图的边缘且为O继续遍历
        if(i > 1 && board[i - 1][j] == 'O'){
            board[i - 1][j] = 'P';
            dfs(board,i - 1,j,m,n);
        }
        
        //如果该点的下面的点未到图的边缘且为O继续遍历
        if(i < m - 1 && board[i + 1][j] == 'O'){
            board[i + 1][j] = 'P';
            dfs(board,i + 1,j,m,n);
        }
        
        //如果该点的左边的点未到图的边缘且为O继续遍历
        if(j > 1 && board[i][j - 1] == 'O'){
            board[i][j - 1] = 'P';
            dfs(board,i,j - 1,m,n);
        }
        
        //如果该点的左边的点未到图的边缘且为O继续遍历
        if(j < n - 1 && board[i][j + 1] == 'O'){
            board[i][j + 1] = 'P';
            dfs(board,i,j + 1,m,n);
        }
    }
};
//解题思路：
//1，先遍历一遍外围的点，如果是O替换为P
//2，遇到O之后深度遍历O周围的O也替换为P
//3，最后一步，将P换回O，将O替换成X