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
class Solution {
public:
    void solve(vector<vector<char>> &board) {
        int m = board.size();
        if(m <= 2) {
            return;
        }
        int n = board[0].size();
        stack<pair<int, int> > st;
        for(int i = 0; i < m; ++i) {
            for(int j = 0; j < n; ++j) {
                if(board[i][j] == 'O' &&(i == 0 || i == m - 1 || j == 0 || j == n - 1)) {
                    board[i][j] = 'N';
                    st.push(make_pair(i, j));
                }
            }
        }
      
        const int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
        while(!st.empty()) {
            pair<int, int> cur = st.top();
            st.pop();
            for(int i = 0; i < 4; ++i) {
                int r = cur.first + dir[i][0];
                int c = cur.second + dir[i][1];
                if(r >= 0 && r < m && c >= 0 && c < n && board[r][c] == 'O') {
                    board[r][c] = 'N';
                    st.push(make_pair(r, c));
                }
            }
        }
        for(int i = 0; i < m; ++i) {
            for(int j = 0; j < n; ++j) {
                if(board[i][j] == 'N') {
                    board[i][j] = 'O';
                } else if(board[i][j] == 'O') {
                    board[i][j] = 'X';
                }
            }
        }
    }
};



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值