130. Surrounded Regions
来源:互联网 发布:网络借贷管理办法 编辑:程序博客网 时间:2024/06/11 18:56
problem:
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 XX O O XX X O XX O X X
After running your function, the board should be:
X X X XX X X XX X X XX O X Xsolution:
class Solution {public:void solve(vector<vector<char>>& board) { int i,j; int row=board.size(); if(!row) return; int col=board[0].size();for(i=0;i<row;i++){check(board,i,0,row,col);if(col>1)check(board,i,col-1,row,col);}for(j=1;j+1<col;j++){check(board,0,j,row,col);if(row>1)check(board,row-1,j,row,col);}for(i=0;i<row;i++)for(j=0;j<col;j++)if(board[i][j]=='O')board[i][j]='X';for(i=0;i<row;i++)for(j=0;j<col;j++)if(board[i][j]=='1')board[i][j]='O'; }void check(vector<vector<char> >&vec,int i,int j,int row,int col){if(vec[i][j]=='O'){vec[i][j]='1';if(i>1)check(vec,i-1,j,row,col);if(j>1)check(vec,i,j-1,row,col);if(i+1<row)check(vec,i+1,j,row,col);if(j+1<col)check(vec,i,j+1,row,col);}}};
阅读全文
0 0
- [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
- [leetcode] 130. Surrounded Regions
- 网络编程三要素
- python列表的基本知识
- URAL1947 Meander 思路
- 关于android中的两大布局LinearLayout、RelativeLayout
- Tensorflow 读取Txt和Csv格式数据
- 130. Surrounded Regions
- 238. Product of Array Except Self
- Windows物理磁盘扇区读写示例总结
- 数据结构12————二叉树的遍历和建立
- 序列有关BIF
- Hdoj 5702 Solving Order
- 为什么C++11引入了std::ref?
- Java知识点复习系列(5)
- 区块链技术的应用场景与常见疑问