130. Surrounded Regions(unsolved)
来源:互联网 发布:2016最新网络神曲 编辑:程序博客网 时间:2024/06/10 19:25
Given a 2D board containing ‘X’ and ‘O’ (the letter 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
解答:
这道题就是先找出四条边中的O,然后与这个O连接的左右上下都设置为
class Solution {public: void solve(vector<vector<char>>& board) { if(board.empty()) return ; for(int i=0;i<board.size();i++) { for(int j=0;j<board[0].size();j++) { if((i==0||j==0||i==board.size()-1||j==board[i].size()-1)&&(board[i][j]=='O')) solvedfs(board,i,j); } } for(int i=0;i<board.size();i++) { for(int j=0;j<board[0].size();j++) { if(board[i][j]=='$') board[i][j]='O'; else if(board[i][j]=='O') board[i][j]='X'; } } } void solvedfs(vector<vector<char>>& board,int i,int j) { if(board[i][j]=='O') { board[i][j]='$'; if(i>0&&(board[i-1][j]=='O')) solvedfs(board,i-1,j); if((j>1)&&(board[i][j-1]=='O')) solvedfs(board,i,j-1); if(i<board.size()-1&&(board[i+1][j]=='O')) solvedfs(board,i+1,j); if(j<board[i].size()-1&&(board[i][j+1]=='O')) solvedfs(board,i,j+1); } return ; }};
0 0
- 130. Surrounded Regions(unsolved)
- [LeetCode]130.Surrounded Regions
- LeetCode 130. Surrounded Regions
- [leetcode] 130.Surrounded Regions
- 130. Surrounded Regions
- Leetcode 130. Surrounded Regions
- 130. Surrounded Regions
- 130. Surrounded Regions
- leetcode 130. Surrounded Regions
- leetcode 130. Surrounded Regions
- LeetCode 130. Surrounded Regions
- 130. Surrounded Regions
- [LeetCode]130. Surrounded Regions
- LeetCode 130. Surrounded Regions
- 130. Surrounded Regions
- LeetCode *** 130. Surrounded Regions
- 130. Surrounded Regions
- Leetcode 130. Surrounded Regions
- CentOS 7 install Python3.6.1
- Android高德地图定位、点标记、POI
- 初级排序算法总结
- 会议记录
- FreeCodeCamp学习--Title Case a Sentence
- 130. Surrounded Regions(unsolved)
- Markdown 语法说明
- Alphacode
- RSA加密算法原理
- hadoop之倒排索引
- C++内存、 new与malloc分配内存区别
- Servlet总结(二)
- 数据库查询
- 指纹识别-流程