Leetcode #130 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

Difficulty:Medium

把矩阵的外面一层遍历一遍，寻找是O的格子，再用change()把所以与外围O格子相连的格子都标记成a。

最后全部遍历一遍矩阵，将所有的所有的O变成X，所有a变成O。

class Solution {
public:

    void change(int i, int j, vector<vector<char> >& board){
        if(board[i][j]=='a')
           return;
        board[i][j] = 'a';
        int m = board[0].size();
        int n = board.size();
        int a[4][2] = {{0,1}, {0,-1}, {1,0}, {-1,0}};
        for(int k = 0;k<4;k++)
        {
            int nexti = i + a[k][0];
            int nextj = j + a[k][1];
            if(nexti>0&&nexti<n-1&&nextj>0&&nextj<m-1&&board[nexti][nextj]=='O')
                change(nexti,nextj,board);
        }
        
        return;
        
        
    }

    void solve(vector<vector<char> >& board) {
        //vector<vector<char> > b2 = board;
        int n = board.size();
        if(n==0)
           return;
        int m = board[0].size();
        if(m==0)
           return;
        
        for(int i = 0;i<m;i++)
        {
            if(board[0][i]=='O')
               change(0,i,board);
            if(board[n-1][i]=='O')
               change(n-1,i,board);
               
        }
        
        for(int i = 1;i<n-1;i++)
        {
            if(board[i][0]=='O')
               change(i,0,board);
            if(board[i][m-1]=='O')
               change(i,m-1,board);
        }
        
        for(int i = 0;i<m;i++)
           for(int j = 0;j<n;j++)
           {
               if(board[j][i]=='O')
                  board[j][i] = 'X';
               if(board[j][i]=='a')
                  board[j][i] = 'O';
           }
           
         return;
        
    }
};