124_leetcode_Surrounded Regions

155 篇文章 0 订阅
155 篇文章 0 订阅

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
1:注意特殊情况;2:将board四边上的0, 以及与这些‘0’相邻的‘0’都设置为‘C';2:把board中的其他的‘0’(这些‘0’全部被‘X'包围)设置为‘X'; 3:把board中的‘C'全部设置为‘0’


          void solve(vector<vector<char>> &board) {
        if(board.size() == 0 || board.size() == 1 || board[0].size() == 1 || board.size() == 2 || board[0].size() == 2)
            return;
        
        int rows = (int)board.size();
        int columns = (int)board[0].size();
        
        for(int i = 0; i < columns; i++)
        {
            if(board[0][i] == 'O')
                findUnchangedO(board, 0, i);
        }
        
        for(int i = 0; i < rows; i++)
        {
            if(board[i][0] == 'O')
                findUnchangedO(board, i, 0);
        }
        
        for(int i = 0; i < columns; i++)
        {
            if(board[rows-1][i] == 'O')
                findUnchangedO(board, rows-1, i);
        }
        
        for(int i = 0; i < rows; i++)
        {
            if(board[i][columns-1] == 'O')
                findUnchangedO(board, i, columns-1);
        }
        
        for(int i = 0; i < rows; i++)
        {
            for(int j = 0; j < columns; j++)
                if(board[i][j] == 'O')
                    board[i][j] = 'X';
        }
        
        for(int i = 0; i < rows; i++)
        {
            for(int j = 0; j < columns; j++)
                if(board[i][j] == 'C')
                    board[i][j] = 'O';
        }
        
        return ;
    }
    
    void findUnchangedO(vector<vector<char> > &board, int curX, int curY)
    {
        board[curX][curY] = 'C';
        
        if(curX-1 > 0 && board[curX-1][curY] == 'O')
            findUnchangedO(board, curX-1, curY);
        if(curY - 1 > 0 && board[curX][curY - 1] == 'O')
            findUnchangedO(board, curX, curY - 1);
        
        if(curX + 1 < board.size() && board[curX + 1][curY] == 'O')
            findUnchangedO(board, curX + 1, curY);
        if(curY + 1 < board[0].size() && board[curX][curY + 1] == 'O')
            findUnchangedO(board, curX, curY + 1);
    }


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值